An Incremental Method for Solving Convex Finite Min-Max Problems
From MaRDI portal
Recommendations
- A Regularization Method for Solving the Finite Convex Min-Max Problem
- A partially inexact bundle method for convex semi-infinite minmax problems
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- Incremental bundle methods using upper models
- A proximal-projection partial bundle method for convex constrained minimax problems
Cited in
(32)- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
- Probabilistic optimization via approximate \(p\)-efficient points and bundle methods
- A method for convex minimization based on translated first-order approximations
- The effect of deterministic noise in subgradient methods
- An incremental bundle method for portfolio selection problem under second-order stochastic dominance
- A proximal-projection partial bundle method for convex constrained minimax problems
- Optimal replenishment order placement in a finite time horizon
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
- THE INCREMENTAL MINING OF CONSTRAINED CUBE GRADIENTS
- Lower and upper bounds for the spanning tree with minimum branch vertices
- Incremental bundle methods using upper models
- An asynchronous bundle-trust-region method for dual decomposition of stochastic mixed-integer programming
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- On solving the convex semi-infinite minimax problems via superlinear \(\mathcal{VU}\) incremental bundle technique with partial inexact oracle
- Adaptive Bundle Methods for Nonlinear Robust Optimization
- A smooth inexact penalty reformulation of convex problems with linear constraints
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints
- Minimizing Piecewise-Concave Functions Over Polyhedra
- A splitting bundle approach for non-smooth non-convex minimization
- An Incremental Model for Combinatorial Maximization Problems
- Essentials of numerical nonsmooth optimization
- Essentials of numerical nonsmooth optimization
- A new algorithm for the minimax location problem with the closest distance
- A scalable convex min-max optimization algorithm for robust control of polytopic positive systems
- Convex semi-infinite programming algorithms with inexact separation oracles
- A new approach for solving minimax problems using new generation smoothing techniques
- Identification of active component functions in finite-max minimisation via a smooth reformulation
- A new smoothing function technique for solving minimax problems
- On solving the Lagrangian dual of integer programs via an incremental approach
- A partially inexact bundle method for convex semi-infinite minmax problems
- Incremental-like bundle methods with application to energy planning
This page was built for publication: An Incremental Method for Solving Convex Finite Min-Max Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387972)
