Convergence of an interior point algorithm for continuous minimax
type: Item
instance of: scholarly article
title: Convergence of an interior point algorithm for continuous minimax
zbMATH Open document ID: 1194.90118
author: Yanyan Li
published in: Journal of Optimization Theory and Applications
publication date: 2010-09-22T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C47
zbMATH DE Number: 5790057
zbMATH Keywords: worst case analysis
zbMATH Keywords: semi-infinite programming
MaRDI profile type: Publication
full work available at URL: s10957-007-9290-1
OpenAlex ID: W1965788720
cites work: An interior point algorithm for continuous minimax: implementation and computation
cites work: An algorithm for composite nonsmooth optimization problems
cites work: Q3481506
cites work: An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
cites work: An interior-point algorithm for nonlinear minimax problems
cites work: Q4779122
cites work: Linearization method for continuous min-max problem
cites work: Optimization. Algorithms and consistent approximations
cites work: Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
cites work: Algorithms with adaptive smoothing for finite minimax problems
cites work: Solving Semi-Infinite Optimization Problems with Interior Point Techniques
cites work: Convex Analysis
cites work: Q4151662
cites work: Point-to-Set Maps in Mathematical Programming
cites work: An algorithm for the global optimization of a class of continuous minimax problems
cites work: On the formulation and theory of the Newton interior-point method for nonlinear programming
cites work: Globally convergent interior-point algorithm for nonlinear programming
DOI: 10.1007/S10957-007-9290-1
description: scientific article; zbMATH DE number 5790057