A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
From MaRDI portal
Publication:3773699
DOI10.1137/0325051zbMath0634.90054OpenAlexW2089856363MaRDI QIDQ3773699
Publication date: 1987
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1903/4388
superlinear convergencesuccessive quadratic programmingengineering design applicationshard inequality constraints
Related Items (75)
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 ⋮ On combining feasibility, descent and superlinear convergence in inequality constrained optimization ⋮ A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity ⋮ A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints ⋮ New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate ⋮ A modified SQP algorithm for minimax problems ⋮ An efficient feasible SQP algorithm for inequality constrained optimization ⋮ A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization ⋮ 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 new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ A simple feasible SQP algorithm for inequality constrained optimization ⋮ A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality constraints ⋮ An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point ⋮ New sequential quadratic programming algorithm with consistent subproblems ⋮ A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence ⋮ An SQP-type Method with Superlinear Convergence for Nonlinear Semidefinite Programming ⋮ 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 superlinearly convergent numerical algorithm for nonlinear programming ⋮ A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ On the comparative optimal analysis and synthesis of four-bar function generating mechanism using different heuristic methods ⋮ A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization ⋮ 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 analysis of an ALF-based nonconvex splitting algorithm with SQP structure ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ A new SQP method of feasible directions for nonlinear programming. ⋮ Stochastic ultimate load analysis:models and solution methods1 ⋮ A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application ⋮ An interior point type QP-free algorithm with superlinear convergence for 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 ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences ⋮ An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments ⋮ A sequential quadratically constrained quadratic programming method of feasible directions ⋮ Global and local convergence of a class of penalty-free-type methods for nonlinear programming ⋮ A superlinearly convergent method of feasible directions. ⋮ An improved sequential quadratic programming algorithm for solving general nonlinear programming problems ⋮ An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity ⋮ The use of QP-free algorithm in the limit analysis of slope stability ⋮ Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization ⋮ An efficient sequential quadratic programming algorithm for nonlinear programming ⋮ A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity ⋮ A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity ⋮ A feasible SQP method for nonlinear programming ⋮ Mathematical programming models and algorithms for engineering design optimization ⋮ Global and local convergence of a filter line search method for nonlinear programming ⋮ A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ A robust SQP method based on a smoothing lower order penalty function† ⋮ Generalized monotone line search SQP algorithm for constrained minimax problems ⋮ Feasible direction interior-point technique for nonlinear optimization ⋮ An active set sequential quadratic programming algorithm for nonlinear optimisation ⋮ An SQP algorithm for mathematical programs with nonlinear complementarity constraints ⋮ An ADMM-based SQP method for separably smooth nonconvex optimization ⋮ A global QP-free algorithm for mathematical programs with complementarity constraints ⋮ A feasible and superlinear algorithm for inequality constrained minimization problems ⋮ Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions ⋮ A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization ⋮ A globally and superlinearly convergent feasible QP-free method for nonlinear programming ⋮ Improved filter-SQP algorithm with active set for constrained minimax problems ⋮ Algorithms for optimal signal set design ⋮ A superlinearly and quadratically convergent SQP type feasible method for constrained optimization ⋮ A generalized project metric algorithm for mathematical programs with equilibrium constraints ⋮ A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints
This page was built for publication: A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
