Pages that link to "Item:Q2372939"

The following pages link to Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939):

Displaying 19 items.

• Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
• A nonlinear augmented Lagrangian for constrained minimax problems (Q427029) (← links)
• A generalized neural network for solving a class of minimax optimization problems with linear constraints (Q433302) (← 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 modified SQP algorithm for minimax problems (Q837129) (← links)
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
• A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448) (← links)
• A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization (Q2104108) (← links)
• A globally convergent QP-free algorithm for inequality constrained minimax optimization (Q2151966) (← links)
• Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems (Q2250067) (← links)
• Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
• An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems (Q2439373) (← links)
• (Q3014469) (← links)
• A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints (Q3188452) (← links)
• Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)
• A New Nonmonotone Linesearch SQP Algorithm for Unconstrained Minimax Problem (Q4979781) (← links)
• A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints (Q4995612) (← links)
• A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems (Q5881251) (← links)