Quadratic convex-concave minimax optimization

DOI10.1142/S021759592550023XMaRDI QIDQ6851761zbMATH OpenFDO

Authors Yu Chen, Long-Fei Wang

Publication date 26 February 2026

Published in Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S021759592550023X

zbMATH Keywords

quadratic programmingglobal optimizationsemidefinite programmingfractional programmingminimax optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Linear programming (90C05) Fractional programming (90C32) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Minimax problems in mathematical programming (90C47)

Cites work

• scientific article; zbMATH DE number 53598 (Why is no real title available?)
• scientific article; zbMATH DE number 3323651 (Why is no real title available?)
• scientific article; zbMATH DE number 3368525 (Why is no real title available?)
• A Survey of the S-Lemma
• A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems
• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• A note on an algorithm for generalized fractional programs
• A novel affine relaxation-based algorithm for minimax affine fractional program
• A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming
• An Outer Space Approach to Tackle Generalized Affine Fractional Program Problems
• An algorithm for generalized fractional programs
• An ellipsoid algorithm for nonlinear programming
• An improved ellipsoid method for solving convex differentiable optimization problems
• Best Rational Approximation and Strict Quasi-Convexity
• Calabi-Polyak convexity theorem, Yuan'S lemma and S-lemma: extensions and applications
• Convex Analysis
• Farkas' lemma: three decades of generalizations for mathematical optimization
• Feature Article—The Ellipsoid Method: A Survey
• Generalized Cheney-Loeb-Dinkelbach-Type Algorithms
• Image space branch-and-bound algorithm for globally solving minimax linear fractional programming problem
• Interval division and linearization algorithm for minimax linear fractional program
• On Nonlinear Fractional Programming
• On minimizing the ratio of quadratic functions over an ellipsoid
• Polynomial algorithms in linear programming
• Theorie der einfachen Ungleichungen.
• Toward nonquadratic S-lemma: new theory and application in nonconvex optimization

This page was built for publication: Quadratic convex-concave minimax optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6851761)