Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
From MaRDI portal
Publication:2413100
DOI10.1007/s10107-017-1112-0zbMath1401.90169arXiv1701.04087OpenAlexW2575486826MaRDI QIDQ2413100
Publication date: 6 April 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.04087
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items
Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness, An augmented Lagrangian method for optimization problems with structured geometric constraints, Relaxed constant positive linear dependence constraint qualification for disjunctive systems, Constrained composite optimization and augmented Lagrangian methods, Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs, Optimality conditions for locally Lipschitz optimization with \(l_0\)-regularization, Convergence properties of monotone and nonmonotone proximal gradient methods revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron
- Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
- New results on constraint qualifications for nonlinear extremum problems and extensions
- A relaxed constant positive linear dependence constraint qualification and applications
- On metric and calmness qualification conditions in subdifferential calculus
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
- Sufficient Conditions for Error Bounds
- Optimality Conditions and a Smoothing Trust Region Newton Method for NonLipschitz Optimization
- An Augmented Lagrangian Method for Non-Lipschitz Nonconvex Programming
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
- The approximate subdifferential of composite functions
- First Order and Second Order Characterizations of Metric Subregularity and Calmness of Constraint Set Mappings
- Linearly Constrained Non-Lipschitz Optimization for Image Restoration
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Optimization and nonsmooth analysis
- Some continuity properties of polyhedral multifunctions
- Variational Analysis
- Necessary conditions for constrained optimization problems with semicontinuous and continuous data
- Joint Power and Admission Control: Non-Convex <formula formulatype="inline"><tex Notation="TeX">$L_{q}$</tex></formula> Approximation and An Effective Polynomial Time Deflation Approach
- Nonsmooth sequential analysis in Asplund spaces
- Two New Weak Constraint Qualifications and Applications
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- Mathematical Programs with Geometric Constraints in Banach Spaces: Enhanced Optimality, Exact Penalty, and Sensitivity
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
