Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems
From MaRDI portal
Publication:1935267
DOI10.1007/s10957-012-0109-3zbMath1257.90109MaRDI QIDQ1935267
Publication date: 14 February 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0109-3
rate of convergence; robust optimization; exponential smoothing technique; discretization algorithms; semiinfinite minimax problems
Related Items
Optimality functions and lopsided convergence, Substitution secant/finite difference method to large sparse minimax problems, Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems, Group update method for sparse minimax problems, An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- First-order methods of smooth convex optimization with inexact oracle
- Adaptive constraint reduction for convex quadratic programming
- On solving large-scale finite minimax problems using exponential smoothing
- Algorithms with adaptive smoothing for finite minimax problems
- Semi-infinite programming
- A smoothing trust-region Newton-CG method for minimax problem
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- A smoothing projected Newton-type algorithm for semi-infinite programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Optimization. Algorithms and consistent approximations
- Introductory lectures on convex optimization. A basic course.
- Optimal Budget Allocation for Sample Average Approximation
- On Choosing Parameters in Retrospective-Approximation Algorithms for Stochastic Root Finding and Simulation Optimization
- Theory and Applications of Robust Optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming, duality, discretization and optimality conditions†
- On the Extension of Newton’s Method to Semi-Infinite Minimax Problems
- Rate-Preserving Discretization Strategies for Semi-Infinite Programming and Optimal Control
- Simulation optimization using the cross-entropy method with optimal computing budget allocation
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- Smoothing method for minimax problems
- Discretization in semi-infinite programming: the rate of convergence
