On solving large-scale finite minimax problems using exponential smoothing
From MaRDI portal
Publication:535071
DOI10.1007/s10957-010-9759-1zbMath1216.90097OpenAlexW1987793616MaRDI QIDQ535071
Publication date: 11 May 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-010-9759-1
Related Items (18)
A SSLE-Type Algorithm of Quasi-Strongly Sub-Feasible Directions for Inequality Constrained Minimax Problems ⋮ Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions ⋮ On sample size control in sample average approximations for solving smooth stochastic programs ⋮ A globally convergent QP-free algorithm for inequality constrained minimax optimization ⋮ A Level-Set Method for Convex Optimization with a Feasible Solution Path ⋮ Substitution secant/finite difference method to large sparse minimax problems ⋮ Rate of convergence analysis of discretization and smoothing algorithms for semiinfinite minimax problems ⋮ Some computable quasiconvex multiwell models in linear subspaces without rank-one matrices ⋮ Flattened aggregate function method for nonlinear programming with many complicated constraints ⋮ A QP-free algorithm for finite minimax problems ⋮ Convex Optimization for Group Feature Selection in Networked Data ⋮ Group update method for sparse minimax problems ⋮ Unnamed Item ⋮ Distributionally robust chance constrained optimization for economic dispatch in renewable energy integrated systems ⋮ Optimality functions in stochastic programming ⋮ Solving implicit mathematical programs with fuzzy variational inequality constraints based on the method of centres with entropic regularization ⋮ Delaunay-based derivative-free optimization via global surrogates. III: nonconvex constraints ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms with adaptive smoothing for finite minimax problems
- A smoothing trust-region Newton-CG method for minimax problem
- On the convergence of the Pshenichnyi-Pironneau-Polak minimax algorithm with an active set strategy
- An algorithm based on active sets and smoothing for discretized semi-infinite minimax problems
- An interior-point algorithm for nonlinear minimax problems
- An improved SQP algorithm for solving minimax problems
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- On the rate of convergence of two minimax algorithms
- Optimization. Algorithms and consistent approximations
- Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Portfolio Optimization Under a Minimax Rule
- A globally convergent algorithm with adaptively refined discretization for semi-infinite optimization problems arising in engineering design
- Adaptive control of ARMA plants using worst-case design by semi-infinite optimization
- On the complexity of the exchange algorithm for minimax optimization problems
- An SQP Algorithm for Finely Discretized Continuous Minimax Problems and Other Minimax Problems with Many Objective Functions
- On complexity of the translational-cut algorithm for convex minimax problems
- Smoothing method for minimax problems
This page was built for publication: On solving large-scale finite minimax problems using exponential smoothing
