A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
From MaRDI portal
Publication:2719243
DOI10.1137/S1052623498344562zbMath1035.90105OpenAlexW2156762405MaRDI QIDQ2719243
Craig T. Lawrence, André L. Tits
Publication date: 21 June 2001
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623498344562
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Methods of quasi-Newton type (90C53) Methods of successive quadratic programming type (90C55)
Related Items (57)
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 ⋮ A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity ⋮ New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate ⋮ Parallel variable distribution algorithm for constrained optimization with nonmonotone technique ⋮ 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 ⋮ DC Programming and DCA for General DC Programs ⋮ A strongly convergent norm-relaxed method of strongly sub-feasible direction for optimization with nonlinear equality and inequality 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 SQP-GS algorithm for nonconvex, nonsmooth constrained optimization ⋮ Minimizing almost smooth control variation in nonlinear optimal control problems ⋮ A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization ⋮ A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization ⋮ Spatiotemporal vaccine allocation policies for epidemics with behavioral feedback dynamics ⋮ The exponentiated generalized inverse Gaussian distribution ⋮ Parameter identification in financial market models with a feasible point SQP algorithm ⋮ Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints ⋮ A variant of SQP method for inequality constrained optimization and its global convergence ⋮ A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization ⋮ Abstract model repair for probabilistic systems ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ Inverse determination of kinetic rate constants for transesterification of vegetable oils ⋮ Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems ⋮ Improving solver success in reaching feasibility for sets of nonlinear constraints ⋮ A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function ⋮ A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization ⋮ A norm-relaxed method of feasible directions for finely discretized problems from semi-infinite programming ⋮ A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems ⋮ A sequential equality constrained quadratic programming algorithm for inequality constrained optimization ⋮ Estimation of Time Varying Skewness and Kurtosis with an Application to Value at Risk ⋮ Hybrid evolutionary algorithm with Hermite radial basis function interpolants for computationally expensive adjoint solvers ⋮ 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 ⋮ An efficient sequential quadratic programming algorithm for nonlinear programming ⋮ A new norm-relaxed SQP algorithm with global convergence ⋮ A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity ⋮ A feasible SQP method for nonlinear programming ⋮ A feasible interior-point algorithm for nonconvex nonlinear programming ⋮ On min-norm and min-max methods of multi-objective optimization ⋮ A new SQP approach for nonlinear complementarity problems ⋮ A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization ⋮ Modeling and forecasting (un)reliable realized covariances for more reliable financial decisions ⋮ A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization ⋮ Multivariate mixed normal conditional heteroskedasticity ⋮ An active set sequential quadratic programming algorithm for nonlinear optimisation ⋮ A superlinear convergence feasible sequential quadratic programming algorithm for bipedal dynamic walking robot via discrete mechanics and optimal control ⋮ A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization ⋮ Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions ⋮ A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization ⋮ An interval sequential linear programming for nonlinear robust optimization problems ⋮ A coupled complex boundary method for an inverse conductivity problem with one measurement
Uses Software
This page was built for publication: A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm
