Convergence of an interior point algorithm for continuous minimax
From MaRDI portal
Publication:1956470
DOI10.1007/s10957-007-9290-1zbMath1194.90118MaRDI QIDQ1956470
Publication date: 22 September 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-007-9290-1
Related Items
Continuous models combining slacks-based measures of efficiency and super-efficiency, Solving quality control problems with an algorithm for minimax programs with coupled constraints, A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems, Mean and variance optimization of non-linear systems and worst-case analysis, An algorithm for the global optimization of a class of continuous minimax problems, An algorithm based on semidefinite programming for finding minimax optimal designs, A QP-free algorithm for finite minimax problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Algorithms with adaptive smoothing for finite minimax problems
- An interior-point algorithm for nonlinear minimax problems
- An algorithm for the global optimization of a class of continuous minimax problems
- An algorithm for composite nonsmooth optimization problems
- Optimization. Algorithms and consistent approximations
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- Globally convergent interior-point algorithm for nonlinear programming
- An interior point algorithm for continuous minimax: implementation and computation
- Linearization method for continuous min-max problem
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Convex Analysis
- Point-to-Set Maps in Mathematical Programming
