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

DOI10.1080/02331934.2022.2086055MaRDI QIDQ6092939

Li-wei Zhang, Yu-Hong Dai

Publication date: 23 November 2023

Published in: Optimization (Search for Journal in Brave)

zbMATH Keywords

convex optimizationaugmented Lagrangian methodmeasure functionshifted problemleast constraint violation

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
• The augmented Lagrangian method for equality and inequality constraints in Hilbert spaces
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• Extended convergence results for the method of multipliers for nonstrictly binding inequality constraints
• Multiplier and gradient methods
• The multiplier method of Hestenes and Powell applied to convex programming
• Infeasibility Detection and SQP Methods for Nonlinear Optimization
• A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
• A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
• Optimization and nonsmooth analysis
• Monotone Operators and the Proximal Point Algorithm
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Variational Analysis
• First-Order Methods in Optimization
• A dual approach to solving nonlinear programming problems by unconstrained optimization
• Convex Analysis
• The augmented Lagrangian method can approximately solve convex optimization with least constraint violation

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