Optimization with least constraint violation

DOI10.4208/CSIAM-AM.2020-0043MaRDI QIDQ6941309zbMATH OpenFDO

Authors Yuhong Dai, Liwei Zhang

Publication date 19 August 2025

Published in CSIAM Transactions on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4208/CSIAM-AM.2020-0043

zbMATH Keywords

l-stationary pointleast constraint violationMPCCnonlinear programmingsmoothing function

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• A modified relaxation scheme for mathematical programs with complementarity constraints
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
• A sequential quadratic optimization algorithm with rapid infeasibility detection
• A smoothing method for mathematical programs with equilibrium constraints
• Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
• First-order methods in optimization
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• scientific article; zbMATH DE number 1502618 (Why is no real title available?)
• Infeasibility Detection and SQP Methods for Nonlinear Optimization
• Nonsmooth analysis
• Numerical Optimization
• Optimization and nonsmooth analysis
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems
• Some continuity properties of polyhedral multifunctions
• Strongly Regular Generalized Equations
• Variational Analysis

Cited in

(1)

• A natural SQP method with potentially infeasible subproblems for nonlinear optimization

This page was built for publication: Optimization with least constraint violation

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