An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization
From MaRDI portal
Publication:3462308
DOI10.1007/978-3-319-17689-5_6zbMath1330.65085OpenAlexW2734531110WikidataQ58185656 ScholiaQ58185656MaRDI QIDQ3462308
Dominique Orban, Phillipe L. Toint, Nick I. M. Gould
Publication date: 5 January 2016
Published in: Numerical Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17689-5_6
convergencenumerical examplesnonconvex optimizationnonlinear programminginterior pointelastic variables\(\ell_1\)-penalty
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)
Related Items
Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, Study of a primal-dual algorithm for equality constrained minimization, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, Extended duality for nonlinear programming, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, First- and second-order necessary conditions via exact penalty functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit resolutions for the complex of several Fueter operators
- A stable and accurate convective modelling procedure based on quadratic upstream interpolation
- Test examples for nonlinear programming codes
- An interior-point algorithm for nonconvex nonlinear programming
- Second-order necessary and sufficient conditions in nonsmooth optimization
- A quasi-Newton penalty barrier method for convex minimization problems
- A theorem of Beurling-Lax type for Hilbert spaces of functions analytic in the unit ball
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach
- Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Superlinear Convergence of Primal-Dual Interior Point Algorithms for Nonlinear Programming
- An $\ell_1$ Elastic Interior-Point Method for Mathematical Programs with Complementarity Constraints
- Two hartogs theorems for nullsolutions of overdetermined systems in euclidean space
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- Second-order conditions for an exact penalty function
- Sufficient conditions for a globally exact penalty function without convexity
- A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
- A lower bound for the controlling parameters of the exact penalty functions
- The Dolbeault complex in infinite dimensions I
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Trust Region Methods
- Cesàro mean distribution of group automata starting from measures with summable decay
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
- A trust region method based on interior point techniques for nonlinear programming.
