Pages that link to "Item:Q2378762"

The following pages link to Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762):

Displaying 12 items.

• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• A superlinearly convergent norm-relaxed method of quasi-strongly sub-feasible direction for inequality constrained minimax problems (Q505808) (← links)
• A quadratically approximate framework for constrained optimization, global and local convergence (Q943517) (← links)
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
• Nonmonotone strategy for minimization of quadratics with simple constraints. (Q1771833) (← links)
• An active-set algorithm and a trust-region approach in constrained minimax problem (Q1993563) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998) (← links)
• The optimality conditions for generalized minimax programming (Q2453279) (← links)
• The optimization technique for solving a class of non-differentiable programming based on neural network method (Q2655120) (← links)
• (Q4397866) (← links)
• A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints (Q4995612) (← links)