A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
From MaRDI portal
Publication:1740436
DOI10.1016/j.amc.2017.08.013zbMath1426.90236OpenAlexW2755446089MaRDI QIDQ1740436
Publication date: 30 April 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.08.013
global convergencesuperlinear convergenceQP-free algorithmfilter-freegeneral-constrained optimizationpenalty-function-free
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)
Related Items (3)
A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ The New Approach for Dynamic Optimization with Variability Constraints
Cites Work
- Unnamed Item
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization
- A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
- A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
- Nonlinear programming without a penalty function or a filter
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization
- Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions
- Test examples for nonlinear programming codes
- A QP-free constrained Newton-type method for variational inequality problems
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function
- A simple primal-dual feasible interior-point method for nonlinear programming with monotone descent
- Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- Exact penalty function algorithm with simple updating of the penalty parameter
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- An infeasible nonmonotone SSLE algorithm for nonlinear programming
- A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems
- A New QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm For Inequality Constrained Optimization
- A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
- A Globally and Superlinearly Convergent Primal-dual Interior Point Method for General Constrained Optimization
- A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization
- A Feasible Active Set QP-Free Method for Nonlinear Programming
- Generalized monotone line search SQP algorithm for constrained minimax problems
- A successive quadratic programming algorithm with global and superlinear convergence properties
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Strongly Regular Generalized Equations
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
- A Sequential Quadratically Constrained Quadratic Programming Method for Differentiable Convex Minimization
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- On the Global Convergence of a Filter--SQP Algorithm
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Line Search Filter Methods for Nonlinear Programming: Local Convergence
- Nonlinear programming without a penalty function.
This page was built for publication: A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
