An algorithm for the global optimization of a class of continuous minimax problems
From MaRDI portal
Publication:1028590
DOI10.1007/s10957-008-9473-4zbMath1168.90016OpenAlexW2010978740MaRDI QIDQ1028590
Publication date: 6 July 2009
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3852
Related Items (17)
LP relaxations for a class of linear semi-infinite programming problems ⋮ A new expected-improvement algorithm for continuous minimax optimization ⋮ A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems ⋮ Solving quality control problems with an algorithm for minimax programs with coupled constraints ⋮ Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets ⋮ An algorithm for semi-infinite polynomial optimization ⋮ Worst-case global optimization of black-box functions through Kriging and relaxation ⋮ A computational algorithm for selecting robust designs in safety and quality critical processes ⋮ Convergence of an interior point algorithm for continuous minimax ⋮ Min-max and robust polynomial optimization ⋮ Semidefinite relaxations for semi-infinite polynomial programming ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ Duality for optimization problems in Banach algebras ⋮ Nonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxations ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ Global optimization with orthogonality constraints via stochastic diffusion on manifold ⋮ Development of modal interval algorithm for solving continuous minimax problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinitely constrained optimization problems
- An algorithm for sums of squares of real polynomials
- Semi-infinite programming and applications to minimax problems
- Semidefinite programming relaxations for semialgebraic problems
- Convergence of an interior point algorithm for continuous minimax
- Global Optimization with Polynomials and the Problem of Moments
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Optimization of Polynomials on Compact Semialgebraic Sets
- GloptiPoly
- Point-to-Set Maps in Mathematical Programming
- An interior point algorithm for computing saddle points of constrained continuous minimax
This page was built for publication: An algorithm for the global optimization of a class of continuous minimax problems
