Pages that link to "Item:Q3962783"
From MaRDI portal
The following pages link to Some methods of solving convex programming problems (Q3962783):
Displayed 8 items.
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- A generalized quadratic programming-based phase I--phase II method for inequality-constrained optimization (Q1205504) (← 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)
- Use of a finite penalty in convex programming problems for global convergence of Newton's method with steep adjustment (Q3042890) (← links)
- A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem (Q5058916) (← links)
- A Globally Convergent SQCQP Method for Multiobjective Optimization Problems (Q5148405) (← links)