An interior-point _12-penalty method for inequality constrained nonlinear optimization
From MaRDI portal
Publication:898716
Recommendations
- An interior-point \(\ell_1\)-penalty method for nonlinear optimization
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- scientific article; zbMATH DE number 5524381
- A penalized interior point approach for constrained nonlinear programming
- A penalty-interior-point algorithm for nonlinear constrained optimization
Cites work
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 1131479 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
- A Unified Augmented Lagrangian Approach to Duality and Exact Penalization
- A line search exact penalty method using steering rules
- A penalty-interior-point algorithm for nonlinear constrained optimization
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A robust SQP method based on a smoothing lower order penalty function†
- An interior-point algorithm for nonconvex nonlinear programming
- Automatic decrease of the penalty parameter in exact penalty function methods
- Benchmarking optimization software with performance profiles.
- Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
- Decreasing Functions with Applications to Penalization
- First- and second-order necessary conditions via exact penalty functions
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions
- Interior Point Methods for Nonlinear Optimization
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- Interior-point methods for optimization
- Lagrange Multipliers and Calmness Conditions of Order p
- Mathematical Programs with Equilibrium Constraints
- On the Newton interior-point method for nonlinear programming problems
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the smoothing of the square-root exact penalty function for inequality constrained optimization
- Optimality conditions in smooth nonlinear programming
- Optimality conditions via exact penalty functions
- Restricted isometry properties and nonconvex compressive sensing
- Smoothing Nonlinear Penalty Functions for Constrained Optimization Problems
- Smoothing methods for nonsmooth, nonconvex minimization
- Steering exact penalty methods for nonlinear programming
- Variational Analysis
Cited in
(7)- An inner approximation method incorporating with a penalty function method for a reverse convex programming problem
- THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
- First- and second-order necessary conditions via exact penalty functions
- 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
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- An interior-point \(\ell_1\)-penalty method for nonlinear optimization
This page was built for publication: An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898716)
