A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
From MaRDI portal
Publication:3796973
DOI10.1137/0326046zbMath0651.90072OpenAlexW1994635453MaRDI QIDQ3796973
André L. Tits, José Herskovits, E. R. Panier
Publication date: 1988
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/da5d4cb0be10f14344fa86a38e423c393e64e9ae
global convergenceconstrained optimizationlocal superlinear convergencelinear systems of equationsengineering system designsmooth inequality constraintsKuhn-Tucker first order conditions of optimalityminimization of a smooth functionperturbation of a quasi-Newton iteration
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37)
Related Items (73)
A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ A globally convergent QP-free algorithm for nonlinear semidefinite programming ⋮ A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity ⋮ Feasible methods for nonconvex nonsmooth problems with applications in green communications ⋮ Regular and Critical States in Elastic Nonlinear Systems with Displacement Constraints ⋮ On combining feasibility, descent and superlinear convergence in inequality constrained optimization ⋮ An infeasible nonmonotone SSLE algorithm for nonlinear programming ⋮ A type of efficient feasible SQP algorithms for inequality constrained optimization ⋮ A new trust region–sequential quadratic programming approach for nonlinear systems based on nonlinear model predictive control ⋮ A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ Piecewise linear NCP function for QP free feasible method ⋮ A simple feasible SQP algorithm for inequality constrained optimization ⋮ An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point ⋮ An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization ⋮ Sequential systems of linear equations algorithm for nonlinear optimization problems with general constraints ⋮ Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ A feasible directions method for nonsmooth convex optimization ⋮ A superlinearly convergent numerical algorithm for nonlinear programming ⋮ Newton-KKT interior-point methods for indefinite quadratic programming ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ An improved feasible QP-free algorithm for inequality constrained optimization ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ Convergence of a projected gradient method with trust region for nonlinear constrained optimization† ⋮ A constraint-reduced variant of Mehrotra's predictor-corrector algorithm ⋮ Sequential systems of linear equations algorithm for nonlinear optimization problems -- general constrained problems. ⋮ An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems ⋮ A control problem arising in the process of waste water purification ⋮ A smoothing QP-free infeasible method for nonlinear inequality constrained optimization ⋮ An interior point type QP-free algorithm with superlinear convergence for inequality 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 quadratically approximate framework for constrained optimization, global and local convergence ⋮ A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization ⋮ AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY ⋮ A quasi-Monte-Carlo-based feasible sequential system of linear equations method for stochastic programs with recourse ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization ⋮ An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization ⋮ Globally convergent cutting plane method for nonconvex nonsmooth minimization ⋮ A superlinearly convergent method of feasible directions. ⋮ An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity ⋮ A Filter Active-Set Algorithm for Ball/Sphere Constrained Optimization Problem ⋮ Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization ⋮ An efficient sequential quadratic programming algorithm for nonlinear programming ⋮ Newton-type methods: a broader view ⋮ A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity ⋮ A modified QP-free feasible method ⋮ A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity ⋮ Sequential systems of linear equations method for general constrained optimization without strict complementarity ⋮ A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization ⋮ Mathematical programming models and algorithms for engineering design optimization ⋮ A new QP-free algorithm without a penalty function or a filter for nonlinear semidefinite programming ⋮ A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization ⋮ Some Applications of Optimal Control Theory of Distributed Systems ⋮ A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems ⋮ A kind of QP-free feasible method ⋮ An infeasible active-set QP-free algorithm for general nonlinear programming ⋮ Feasible direction interior-point technique for nonlinear optimization ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ Variable-metric technique for the solution of affinely parametrized nondifferentiable optimal design problems ⋮ A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control ⋮ A globally and superlinearly convergent feasible QP-free method for nonlinear programming ⋮ An infeasible QP-free method without a penalty function for nonlinear inequality constrained optimization ⋮ A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints ⋮ A smooth QP-free algorithm without a penalty function or a filter for mathematical programs with complementarity constraints ⋮ A superlinearly convergent SSLE algorithm for optimization problems with linear complementarity constraints
This page was built for publication: A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
