Pages that link to "Item:Q635233"

The following pages link to A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233):

Displaying 11 items.

• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• New active set identification for general constrained optimization and minimax problems (Q743206) (← 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)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• A dwindling filter algorithm with a modified subproblem for nonlinear inequality constrained optimization (Q2448469) (← links)
• Convergence of a Three-Dimensional Dwindling Filter Algorithm Without Feasibility Restoration Phase (Q2805993) (← links)
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)
• A sequential quadratic programming algorithm without a penalty function, a filter or a constraint qualification for inequality constrained optimization (Q5085236) (← links)
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems (Q5881251) (← links)
• A hybrid genetic algorithm-based parameter identification method for nonlinear hysteretic system with experimental verification (Q6538400) (← links)