Pages that link to "Item:Q2640450"
From MaRDI portal
The following pages link to A sequential quadratic programming method for potentially infeasible mathematical programs (Q2640450):
Displaying 28 items.
- Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← links)
- An efficient feasible SQP algorithm for inequality constrained optimization (Q837710) (← links)
- A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
- Subdifferentials of perturbed distance functions in Banach spaces (Q967234) (← links)
- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization (Q1000785) (← links)
- On the Clarke subdifferential of the distance function of a closed set (Q1191783) (← links)
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- Analysis and implementation of a dual algorithm for constrained optimization (Q1321425) (← links)
- Robust recursive quadratic programming algorithm model with global and superlinear convergence properties (Q1356094) (← links)
- A nonmonotone trust-region algorithm with nonmonotone penalty parameters for constrained optimization (Q1883470) (← links)
- Exact barrier function methods for Lipschitz programs (Q1895790) (← links)
- An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
- On the weak stationarity conditions for mathematical programs with cardinality constraints: a unified approach (Q2234331) (← links)
- A feasible SQP method for nonlinear programming (Q2266975) (← links)
- On the augmented subproblems within sequential methods for nonlinear programming (Q2403109) (← links)
- A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
- A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
- Subdifferential regularities of perturbed distance functions outside the target set in Banach spaces (Q2509653) (← links)
- A sequential quadratic programming method for potentially infeasible mathematical programs (Q2640450) (← links)
- An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
- Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver (Q3300768) (← links)
- A robust SQP method based on a smoothing lower order penalty function† (Q3622004) (← links)
- An LP-based algorithm for the correction of inconsistent linear equation and inequality systems (Q4327910) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- An inexact first-order method for constrained nonlinear optimization (Q5038172) (← links)
- Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case (Q5058371) (← links)
- Nonsmooth equation based BFGS method for solving KKT systems in mathematical programming (Q5942348) (← links)
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective (Q6093282) (← links)
