Pages that link to "Item:Q289075"
From MaRDI portal
The following pages link to Globalizing stabilized sequential quadratic programming method by smooth primal-dual exact penalty function (Q289075):
Displaying 15 items.
- Newton's method may fail to recognize proximity to optimal points in constrained optimization (Q344970) (← links)
- Combining stabilized SQP with the augmented Lagrangian algorithm (Q887169) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- A globally convergent Levenberg-Marquardt method for equality-constrained optimization (Q1734774) (← links)
- Subspace-stabilized sequential quadratic programming (Q2012234) (← links)
- A product space reformulation with reduced dimension for splitting algorithms (Q2162533) (← links)
- An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm (Q2176284) (← links)
- On the cost of solving augmented Lagrangian subproblems (Q2191763) (← links)
- A regularization method for constrained nonlinear least squares (Q2191800) (← links)
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← links)
- Convergence of a stabilized SQP method for equality constrained optimization (Q2419576) (← links)
- A Regularized Factorization-Free Method for Equality-Constrained Optimization (Q4641674) (← links)
- A globally convergent regularized interior point method for constrained optimization (Q5058383) (← links)
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods (Q5880389) (← links)
- Comments on: Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it (Q5971067) (← links)
