Skip to content
Preprint

Minimax Choice of Projection Geometry under Linear Inequality Constraints

Sep 2026 · 0 citations
Economics

Abstract

Economic theory frequently implies linear inequality restrictions on parameters or functions of interest. A common way to impose such restrictions is to project an unrestricted estimator onto the feasible set. Projection estimators arise naturally from constrained least squares, instrumental variables, generalized method of moments, maximum likelihood, and related extremum procedures. When the sampling covariance, loss function, and projection criterion induce different geometries, the choice of projection geometry can substantially affect risk. We study this choice in a fixed-dimensional local Gaussian experiment under quadratic loss. At exact-boundary configurations where only one maintained inequality binds, inverse-covariance projection is pointwise optimal. When at most two inequalities are locally relevant, it weakly improves on the unrestricted estimator throughout the corresponding local experiment and is minimax over exact-boundary configurations. For an arbitrary number of inequalities, we provide a sufficient condition for boundary minimaxity, but show by counterexample that inverse-covariance projection need not be boundary minimax once three inequalities can bind. Motivated by these results, we propose selecting the projection geometry to minimize worst-case boundary risk subject to a local no-harm condition relative to unrestricted estimation. We develop a feasible implementation and study its finite-sample performance in simulations and an application to gasoline demand.

View source

Similar papers

Preprint Oct 2026

First-order Methods for Variational Inequality Problems with Semi-Infinite Constraints

A single-loop primal-dual constraint extrapolation method (PD-ConEx) that updates primal variables, Lagrange multipliers, and worst-case constraint indices using first-order information, linearization, extrapolation, and projections only onto simple sets is proposed.

Dureksha Thilakasiri, Digvijay Boob · 0 citations
Open access Sep 2026

A Composed Alternating Relaxed Projection Algorithm for Convex Feasibility Problems

The convex feasibility problem aims to find a common point of two or more closed convex sets whose intersection is nonempty. Projection methods such as the method of alternating projections (MAP) and Douglas–Rachford (DR) are standard, but their performance depends strongly on the local geometry of the sets. In particu...

Yu-Ting Shen, Jing-Wei Liang · 0 citations
Preprint Oct 2026

Random projection with linear equalities and inequalities

Random projection is a preprocessing technique for optimization that reduces the number of linear equality constraints by replacing them with random linear combinations while approximately preserving the optimal value. In this paper, we emphasize the role of suprema of random processes, and in particular generic chaini...

Santanu S. Dey, Jing-Ye Xu · 0 citations
Preprint Sep 2026

Gradient-Free Methods for Stochastic Convex Optimization with Stochastic Functional Constraints

We develop accelerated gradient-free methods for stochastic convex optimization with constraints defined by expectations. Our batched primal-dual sliding method uses two-point evaluations sharing a random sample and guarantees expected objective error and expected maximum constraint violation at most $\varepsilon$. It...

Vadim Abronin, A. Gasnikov, D. Dvinskikh · 0 citations
Preprint Sep 2026

Local Optimality and Rigidity of Frobenius Tests for Dense High-Dimensional Covariance Alternatives

We study identity testing for high-dimensional covariance matrices against dense alternatives of unknown direction, with $p/n \to \gamma$. Along a globally positive quadratic precision path, mixing Gaussian alternatives over a Gaussian Orthogonal Ensemble direction yields a contiguous experiment whose log likelihood re...

P. Hansen, W. Ploberger, Tong Chen · 0 citations
Open access Oct 2026

Local minima of the empirical risk in high dimension: General theorems and convex examples

We consider a general model for high-dimensional empirical risk minimization whereby the data xi are d-dimensional Gaussian vectors, the model is parametrized by Θ∈Rd×k and the loss depends on the data via the projection ΘTxi. This setting covers as special cases classical statistics methods (e.g., multinomial regressi...

Kiana Asgari, A. Montanari, Basil Saeed · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.