Pages that link to "Item:Q669396"

The following pages link to A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396):

Displaying 11 items.

• A superlinearly convergent QP-free algorithm for mathematical programs with equilibrium constraints (Q668747) (← links)
• A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
• Feasible direction interior-point technique for nonlinear optimization (Q1273166) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• A BFGS-IP algorithm for solving strongly convex optimization problems with feasibility enforced by an exact penalty approach (Q1849498) (← links)
• A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
• A primal-dual modified log-barrier method for inequality constrained nonlinear optimization (Q2228414) (← links)
• Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application (Q2402390) (← links)
• Primal-dual interior point QP-free algorithm for nonlinear constrained optimization (Q2407660) (← links)
• (Q4719027) (← links)
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems (Q5881251) (← links)