Minimizing Piecewise-Concave Functions Over Polyhedra
From MaRDI portal
Publication:5219555
DOI10.1287/moor.2017.0873zbMath1440.90089OpenAlexW2762438520MaRDI QIDQ5219555
Giovanni Giallombardo, Giovanna Miglionico, Manlio Gaudioso
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2017.0873
Numerical mathematical programming methods (65K05) Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26)
Related Items
Classification in the multiple instance learning framework via spherical separation ⋮ Sequential difference-of-convex programming ⋮ Essentials of numerical nonsmooth optimization ⋮ Feature selection in SVM via polyhedral \(k\)-norm ⋮ Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations ⋮ Essentials of numerical nonsmooth optimization ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A doubly stabilized bundle method for nonsmooth convex optimization
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles
- Piecewise convex maximization problems: Piece adding technique
- A smooth method for the finite minimax problem
- On solving the Lagrangian dual of integer programs via an incremental approach
- A bundle modification strategy for convex minimization
- A partially inexact bundle method for convex semi-infinite minmax problems
- General variable neighborhood search for the continuous optimization
- Computing proximal points of nonconvex functions
- Attraction probabilities in variable neighborhood search
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio
- Variable neighborhood search
- Global optimization and multi knapsack: a percolation algorithm.
- Piecewise-convex maximization problems: algorithm and computational experiments
- Advances in multicriteria analysis
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- The effect of deterministic noise in subgradient methods
- Piecewise linear approximations in nonconvex nonsmooth optimization
- Localization of minimax points
- Adjustable robust optimization models for a nonlinear two-period system
- Incremental Subgradient Methods for Nondifferentiable Optimization
- Comparing different nonsmooth minimization methods and software
- Introduction to Nonsmooth Optimization
- Level bundle methods for oracles with on-demand accuracy
- A Redistributed Proximal Bundle Method for Nonconvex Optimization
- Theory and Applications of Robust Optimization
- A quasisecant method for minimizing nonsmooth functions
- Piecewise convex maximization approach to multiknapsack
- Stopping criteria for linesearch methods without derivatives
- A method for globally minimizing concave functions over convex sets
- Combined lp and quasi-Newton methods for minimax optimization
- Convergent Algorithms for Minimizing a Concave Function
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Generalized Bundle Methods
- An Incremental Method for Solving Convex Finite Min-Max Problems
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- An Algorithm for Minimax Approximation in the Nonlinear Case
- The Piecewise Concave Function
- Variable neighborhood search: Principles and applications
- Piecewise-convex maximization problems.
