A sequential quadratic programming method for potentially infeasible mathematical programs
From MaRDI portal
Publication:2640450
DOI10.1016/0022-247X(89)90111-XzbMath0719.90066OpenAlexW2056868378MaRDI QIDQ2640450
Publication date: 1989
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(89)90111-x
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
An inexact first-order method for constrained nonlinear optimization, A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization, An efficient feasible SQP algorithm for inequality constrained optimization, Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case, Exact barrier function methods for Lipschitz programs, Robust recursive quadratic programming algorithm model with global and superlinear convergence properties, A sequential quadratic programming method for potentially infeasible mathematical programs, A simple feasible SQP algorithm for inequality constrained optimization, Sequential penalty algorithm for nonlinear constrained optimization, On the augmented subproblems within sequential methods for nonlinear programming, An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming, A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective, An improved feasible QP-free algorithm for inequality constrained optimization, An LP-based algorithm for the correction of inconsistent linear equation and inequality systems, A variant of SQP method for inequality constrained optimization and its global convergence, Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver, On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach, On the Clarke subdifferential of the distance function of a closed set, Subdifferentials of perturbed distance functions in Banach spaces, A feasible SQP method for nonlinear programming, Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming, A robust SQP method for mathematical programs with linear complementarity constraints, Subdifferential regularities of perturbed distance functions outside the target set in Banach spaces, An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization, A robust SQP method based on a smoothing lower order penalty function†, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity, A new technique for inconsistent QP problems in the SQP method, Analysis and implementation of a dual algorithm for constrained optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
- A globally convergent algorithm for nonlinearly constrained optimization problems
- An extension of Karmarkar's algorithm for linear programming using dual variables
- A globally convergent method for nonlinear programming
- A sequential quadratic programming method for potentially infeasible mathematical programs
- Lipschitzian properties of multifunctions
- Extensions of subgradient calculus with applications to optimization
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- Projected gradient methods for linearly constrained problems
- Second order necessary and sufficient conditions for convex composite NDO
- An Exact Penalization Viewpoint of Constrained Optimization
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Lower Semicontinuity of Multivalued Linearization Mappings
