Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
type: Item
instance of: scholarly article
title: Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
zbMATH Open document ID: 1257.90109
author: Johannes O. Royset
author: E. Y. Pee
published in: Journal of Optimization Theory and Applications
publication date: 2013-02-14T00:00:00Z
Mathematics Subject Classification ID: 90C47
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 6136253
zbMATH Keywords: semiinfinite minimax problems
zbMATH Keywords: robust optimization
zbMATH Keywords: discretization algorithms
zbMATH Keywords: rate of convergence
zbMATH Keywords: exponential smoothing technique
describes a project that uses: LSSOL
MaRDI profile type: Publication
full work available at URL: s10957-012-0109-3
OpenAlex ID: W1993159399
cites work: Q4779122
cites work: Q3182207
cites work: Theory and Applications of Robust Optimization
cites work: Semi-Infinite Programming: Theory, Methods, and Applications
cites work: Q3840143
cites work: Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
cites work: Semi-infinite programming
cites work: A smoothing projected Newton-type algorithm for semi-infinite programming
cites work: First-order methods of smooth convex optimization with inexact oracle
cites work: Optimization. Algorithms and consistent approximations
cites work: An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
cites work: On solving large-scale finite minimax problems using exponential smoothing
cites work: Semi-infinite programming, duality, discretization and optimality conditions†
cites work: Discretization in semi-infinite programming: the rate of convergence
cites work: Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
cites work: On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
cites work: Simulation optimization using the cross-entropy method with optimal computing budget allocation
cites work: On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization
cites work: Optimal budget allocation for sample average approximation
cites work: Adaptive constraint reduction for convex quadratic programming
cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming
cites work: An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
cites work: Introductory lectures on convex optimization. A basic course.
cites work: Smoothing method for minimax problems
cites work: Algorithms with adaptive smoothing for finite minimax problems
cites work: A smoothing trust-region Newton-CG method for minimax problem
cites work: Q4464640
DOI: 10.1007/S10957-012-0109-3
description: scientific article; zbMATH DE number 6136253