Pages that link to "Item:Q1021864"

The following pages link to An improved SQP algorithm for solving minimax problems (Q1021864):

Displaying 15 items.

• A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
• Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
• A new objective penalty function approach for solving constrained minimax problems (Q489101) (← links)
• A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
• On solving large-scale finite minimax problems using exponential smoothing (Q535071) (← links)
• Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
• New exact penalty function for solving constrained finite min-max problems (Q764635) (← links)
• A QP-free algorithm for finite minimax problems (Q1724124) (← links)
• A gradient-type algorithm for constrained optimization with application to microstructure optimization (Q2175676) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
• An adaptive nonmonotone trust-region method with curvilinear search for minimax problem (Q2451442) (← links)
• The optimization technique for solving a class of non-differentiable programming based on neural network method (Q2655120) (← links)
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)