A penalty-interior-point algorithm for nonlinear constrained optimization
From MaRDI portal
Publication:2392661
constrained optimizationinterior-point methodslarge-scale optimizationnonconvex optimizationnonlinear optimizationpenalty methodspenalty-interior-point methods
Numerical methods based on necessary conditions (49M05) Newton-type methods (49M15) Numerical methods of relaxation type (49M20) Numerical methods involving duality (49M29) Numerical methods based on nonlinear programming (49M37) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Numerical optimization and variational techniques (65K10) Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interior-point methods (90C51)
Recommendations
- An interior-point _1-penalty method for nonlinear optimization
- scientific article; zbMATH DE number 5524381
- A penalized interior point approach for constrained nonlinear programming
- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- A Robust Primal-Dual Interior-Point Algorithm for Nonlinear Programs
Cites work
- A Modeling Language for Mathematical Programming
- A modified barrier function method with improved rate of convergence for degenerate problems
- A modified barrier-augmented Lagrangian method for constrained minimization
- A numerical study of limited memory BFGS methods
- A second derivative SQP method: global convergence
- A trust region method based on interior point techniques for nonlinear programming.
- Adaptive Barrier Update Strategies for Nonlinear Interior Methods
- An algorithm for nonlinear optimization using linear programming and equality constrained subproblems
- An improved branch and bound algorithm for mixed integer nonlinear programs
- An interior-point algorithm for nonconvex nonlinear programming
- Benchmarking optimization software with performance profiles.
- Computational experience with penalty-barrier methods for nonlinear programming
- CUTE
- CUTEr and SifDec
- scientific article; zbMATH DE number 46305 (Why is no real title available?)
- scientific article; zbMATH DE number 679857 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Infeasibility Detection and SQP Methods for Nonlinear Optimization
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Interior Methods for Nonlinear Optimization
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
- Modified barrier functions (theory and methods)
- On the Convergence of Successive Linear-Quadratic Programming Algorithms
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Primal–dual exterior point method for convex optimization
- Review of nonlinear mixed-integer and disjunctive programming techniques
- Steering exact penalty methods for nonlinear programming
Cited in
(24)- A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm
- A double-layer optimization model for flatness control of cold rolled strip
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- Learning to steer nonlinear interior-point methods
- First- and second-order necessary conditions via exact penalty functions
- On the augmented subproblems within sequential methods for nonlinear programming
- An augmented Lagrangian method for equality constrained optimization with rapid infeasibility detection capabilities
- An interior-point _1-penalty method for nonlinear optimization
- Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
- A penalized interior point approach for constrained nonlinear programming
- scientific article; zbMATH DE number 5524381 (Why is no real title available?)
- A two parameter mixed interior-exterior penalty algorithm
- A penalty derivative-free algorithm for nonlinear constrained optimization
- Rapid infeasibility detection in a mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
- On the global convergence of interior-pointnonlinear programming algorithms
- Worst-case complexity of an SQP method for nonlinear equality constrained stochastic optimization
- An overview of nonlinear optimization
- An interior proximal gradient method for nonconvex optimization
- A penalty barrier framework for nonconvex constrained optimization
- An interior point method for nonlinear constrained derivative-free optimization
- An arc-search interior-point algorithm for nonlinear constrained optimization
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
This page was built for publication: A penalty-interior-point algorithm for nonlinear constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392661)
