Pages that link to "Item:Q2370024"

The following pages link to New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate (Q2370024):

Displaying 18 items.

• A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization (Q393748) (← links)
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
• A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
• A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function (Q939555) (← 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)
• Time-delay estimation in state and output equations of nonlinear systems using optimal computational approach (Q1730791) (← 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)
• A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
• A nonlinear norm-relaxed method for finely discretized semi-infinite optimization problems (Q2435607) (← links)
• A simply sequential quadratically constrained quadratic programming method of strongly sub-feasible directions for constrained optimization (Q2841139) (← links)
• A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization (Q5085233) (← links)