Pages that link to "Item:Q2479835"
From MaRDI portal
The following pages link to On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems (Q2479835):
Displaying 11 items.
- Convergence of inexact Newton methods for generalized equations (Q353160) (← links)
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming (Q472338) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
- Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization (Q2116019) (← links)
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
- Newton-type methods: a broader view (Q2260691) (← links)
- A Sequential Minimization Technique for Elliptic Quasi-variational Inequalities with Gradient Constraints (Q4915165) (← links)
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
