Pages that link to "Item:Q4785857"

The following pages link to A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming (Q4785857):

Displaying 24 items.

• On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature (Q297833) (← links)
• A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• An optimal algorithm and superrelaxation for minimization of a quadratic function subject to separable convex constraints with applications (Q715072) (← links)
• A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← links)
• A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
• Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization (Q975356) (← links)
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
• Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
• A superlinearly convergent method to linearly constrained optimization problems under degeneracy (Q1058463) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
• A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application (Q2226311) (← 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 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)
• (Q4612351) (← links)
• A sequential quadratically constrained quadratic programming technique for a multi-objective optimization problem (Q5058916) (← links)
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
• A Globally Convergent SQCQP Method for Multiobjective Optimization Problems (Q5148405) (← links)
• A method of sequential log-convex programming for engineering design (Q6050371) (← links)
• Quaternion matrix decomposition and its theoretical implications (Q6064045) (← links)
• Newton-type methods for constrained optimization with nonregular constraints (Q6122341) (← links)