Pages that link to "Item:Q1205504"
From MaRDI portal
The following pages link to A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504):
Displaying 13 items.
- An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← 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)
- A generalization of the norm-relaxed method of feasible directions (Q1294211) (← links)
- Self-tuning norm-relaxed method of feasible directions (Q1367804) (← links)
- An extended sequential quadratically constrained quadratic programming algorithm for nonlinear, semidefinite, and second-order cone programming (Q1949595) (← links)
- Newton-type methods: a broader view (Q2260691) (← links)
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998) (← links)
- On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems (Q2479835) (← links)
- A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
- An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
