Pages that link to "Item:Q3731379"
From MaRDI portal
The following pages link to A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379):
Displaying 43 items.
- Switching stepsize strategies for sequential quadratic programming (Q635801) (← links)
- Monotone splitting sequential quadratic optimization algorithm with applications in electric power systems (Q779870) (← links)
- An efficient feasible SQP algorithm for inequality constrained optimization (Q837710) (← links)
- Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
- An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← links)
- A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
- An \(RQP\) algorithm using a differentiable exact penalty function for inequality constrained problems (Q1194855) (← links)
- A new successive quadratic programming algorithm (Q1210225) (← links)
- A sequential quadratic programming-based algorithm for the optimization of gas networks (Q1314761) (← links)
- A recursive quadric programming algorithm that uses new nondifferentiable penalty functions (Q1333897) (← links)
- An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point (Q1367215) (← links)
- New sequential quadratic programming algorithm with consistent subproblems (Q1368267) (← links)
- A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence (Q1370303) (← links)
- Combining trust region and linesearch algorithm for equality constrained optimization (Q1428992) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
- A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
- A successive quadratic programming method that uses new corrections for search directions (Q1919937) (← links)
- An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
- A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
- An ADMM-based SQP method for separably smooth nonconvex optimization (Q2069362) (← links)
- A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
- A superlinearly convergent splitting feasible sequential quadratic optimization method for two-block large-scale smooth optimization (Q2088141) (← links)
- A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
- An adaptively regularized sequential quadratic programming method for equality constrained optimization (Q2244236) (← links)
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
- A feasible SQP method for nonlinear programming (Q2266975) (← links)
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090) (← links)
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
- A sequential equality constrained quadratic programming algorithm for inequality constrained optimization (Q2475402) (← links)
- The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization (Q2479147) (← links)
- An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
- Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)
- Combining Trust Region and Line Search Methods for Equality Constrained Optimization (Q4413521) (← links)
- A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
- On the Local Convergence of a Penalty-Function-Free SQP Method (Q4979789) (← links)
- Sequential Quadratic Optimization for Nonlinear Optimization Problems on Riemannian Manifolds (Q5080505) (← links)
- Convergence of the BFGS-SQP Method for Degenerate Problems (Q5308790) (← links)
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming (Q5942348) (← links)
- A symmetric splitting sequential quadratic optimization algorithm for two-block nonlinearly constrained nonconvex optimization (Q6102892) (← links)
- An overview of nonlinear optimization (Q6200213) (← links)