Pages that link to "Item:Q939555"

The following pages link to A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555):

Displaying 10 items.

• An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
• A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• Recursive quadratic programming algorithm that uses an exact augmented Lagrangian function (Q911471) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
• Recursive quadratic programming methods based on the augmented lagrangian (Q3777815) (← links)
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
• (Q5866820) (← links)
• A method of sequential log-convex programming for engineering design (Q6050371) (← links)