JSTOR Daily

On the Convergence of Constrained Optimization Methods with Accurate Hessian Information on a Subspace

This is a preview. Log in through your library . Abstract This paper analyzes methods of the type proposed by Coleman and Conn for nonlinearly constrained optimization. It is shown that if the reduced ...
Nature

Distributed Constraint Optimization and Search Algorithms

Distributed Constraint Optimisation and Search Algorithms form a vital framework for addressing complex decision‐making and scheduling problems in multi-agent systems. These algorithms distribute ...
JSTOR Daily

ON THE EVALUATION COMPLEXITY OF CONSTRAINED NONLINEAR LEAST-SQUARES AND GENERAL CONSTRAINED NONLINEAR OPTIMIZATION USING SECOND-ORDER METHODS

When solving the general smooth nonlinear and possibly nonconvex optimization problem involving equality and/or inequality constraints, an approximate first-order critical point of accuracy ϵ can be ...
Princeton University

Convex Optimization Over Probability Spaces

where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...