Pages that link to "Item:Q2481366"

The following pages link to 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization (Q2481366):

Displaying 8 items.

• An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
• A convergence analysis of a nonlinear Lagrange algorithm for general nonlinear constrained optimization problems (Q2350402) (← links)
• Fast projected gradient method for support vector machines (Q2358069) (← links)
• An entire space polynomial-time algorithm for linear programming (Q2442633) (← links)
• A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
• (Q3466919) (← links)
• The Rate of Convergence of a NLM Based on F–B NCP for Constrained Optimization Problems Without Strict Complementarity (Q5265452) (← links)
• (Q5417166) (← links)