Pages that link to "Item:Q3622010"

The following pages link to Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010):

Displaying 16 items.

• A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
• A nonlinear augmented Lagrangian for constrained minimax problems (Q427029) (← links)
• 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 generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
• Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
• An implementable SAA nonlinear Lagrange algorithm for constrained minimax stochastic optimization problems (Q1721098) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• Nonmonotone line search algorithm for constrained minimax problems (Q1812065) (← links)
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
• A proximal-projection partial bundle method for convex constrained minimax problems (Q2313762) (← links)
• Improved filter-SQP algorithm with active set for constrained minimax problems (Q2336309) (← links)
• A nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← links)
• A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)