Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
From MaRDI portal
Publication:5198049
DOI10.1080/10556788.2018.1528250zbMath1461.65122OpenAlexW2897334136WikidataQ129113576 ScholiaQ129113576MaRDI QIDQ5198049
Publication date: 2 October 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1528250
interior-point methodnonlinear optimizationaugmented Lagrangian methodprimal-dual methodsinfeasibility detection
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities, Constrained composite optimization and augmented Lagrangian methods, An interior point-proximal method of multipliers for convex quadratic programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Handling infeasibility in a large-scale nonlinear optimization algorithm
- Study of a primal-dual algorithm for equality constrained minimization
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Augmented Lagrangian methods for nonlinear programming with possible infeasibility
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- Quadratic convergence of a primal-dual interior point method for degenerate nonlinear optimization problems
- A local convergence property of primal-dual methods for nonlinear programming
- Test examples for nonlinear programming codes
- Local convergence of a primal-dual method for degenerate nonlinear programming
- Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods
- Optimality properties of an augmented Lagrangian method on infeasible problems
- A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- A penalty-interior-point algorithm for nonlinear constrained optimization
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- From global to local convergence of interior methods for nonlinear optimization
- An interior point method for nonlinear programming with infeasibility detection capabilities
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
- Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
- Definite and Semidefinite Quadratic Forms
- Benchmarking optimization software with performance profiles.
