Pages that link to "Item:Q1039448"
From MaRDI portal
The following pages link to A sequential quadratically constrained quadratic programming method for unconstrained minimax problems (Q1039448):
Displaying 15 items.
- Substitution secant/finite difference method to large sparse minimax problems (Q380609) (← links)
- Group update method for sparse minimax problems (Q493251) (← links)
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
- A QP-free algorithm for finite minimax problems (Q1724124) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← 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 nonmonotonic hybrid algorithm for min-max problem (Q2357826) (← links)
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems (Q2378762) (← links)
- A very simple SQCQP method for a class of smooth convex constrained minimization problems with nice convergence results (Q2434998) (← links)
- Quadratic Optimization With Similarity Constraint for Unimodular Sequence Synthesis (Q4621855) (← links)
- A Sequential Minimization Technique for Elliptic Quasi-variational Inequalities with Gradient Constraints (Q4915165) (← 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)
- On the Sequential Quadratically Constrained Quadratic Programming Methods (Q5704159) (← links)
