Study on convex optimization with least constraint violation under a general measure

DOI10.1080/02331934.2022.2086055MaRDI QIDQ6092939zbMATH OpenFDO

Authors Yuhong Dai, Liwei Zhang

Publication date 23 November 2023

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2022.2086055

zbMATH Keywords

augmented Lagrangian methodconvex optimizationleast constraint violationmeasure functionshifted problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• The augmented Lagrangian method can approximately solve convex optimization with least constraint violation
• Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
• scientific article; zbMATH DE number 2201293
• On augmented Lagrangians for optimization problems with a single constraint
• A convex optimization problem in the space of measures under moment constraints

Cites work

• A dual approach to solving nonlinear programming problems by unconstrained optimization
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
• A sequential quadratic optimization algorithm with rapid infeasibility detection
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convex Analysis
• Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
• First-order methods in optimization
• scientific article; zbMATH DE number 6610411 (Why is no real title available?)
• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 3309655 (Why is no real title available?)
• Infeasibility Detection and SQP Methods for Nonlinear Optimization
• Monotone Operators and the Proximal Point Algorithm
• Multiplier and gradient methods
• Optimization and nonsmooth analysis
• The augmented Lagrangian method can approximately solve convex optimization with least constraint violation
• The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
• The multiplier method of Hestenes and Powell applied to convex programming
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• Variational Analysis

Cited in

(2)

• The augmented Lagrangian method can approximately solve convex optimization with least constraint violation
• A globally convergent SQP-type method with least constraint violation for nonlinear semidefinite programming

This page was built for publication: Study on convex optimization with least constraint violation under a general measure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6092939)