An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
From MaRDI portal
Publication:898716
DOI10.3934/jimo.2016.12.949zbMath1328.90144OpenAlexW2525179912MaRDI QIDQ898716
Xiao Qi Yang, Bo-Shi Tian, Kaiwen Meng
Publication date: 18 December 2015
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2016.12.949
nonlinear programmingconstraint qualificationprimal-dual interior-point methodlower-order penalty functionquadratic relaxation
Nonlinear programming (90C30) Interior-point methods (90C51) Numerical methods of relaxation type (49M20)
Related Items
Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach, Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm, First- and second-order necessary conditions via exact penalty functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A line search exact penalty method using steering rules
- Smoothing methods for nonsmooth, nonconvex minimization
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- An interior-point algorithm for nonconvex nonlinear programming
- Automatic decrease of the penalty parameter in exact penalty function methods
- Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the Newton interior-point method for nonlinear programming problems
- First- and second-order necessary conditions via exact penalty functions
- A penalty-interior-point algorithm for nonlinear constrained optimization
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Optimality conditions in smooth nonlinear programming
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- Optimality Conditions via Exact Penalty Functions
- Restricted isometry properties and nonconvex compressive sensing
- Steering exact penalty methods for nonlinear programming
- Interior Point Methods for Nonlinear Optimization
- Interior-point methods for optimization
- A robust SQP method based on a smoothing lower order penalty function†
- Variational Analysis
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- Decreasing Functions with Applications to Penalization
- Lagrange Multipliers and Calmness Conditions of Order p
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- Mathematical Programs with Equilibrium Constraints
- Benchmarking optimization software with performance profiles.
