Piecewise linear approximations in nonconvex nonsmooth optimization
From MaRDI portal
Publication:2391130
DOI10.1007/s00211-009-0228-4zbMath1179.65066OpenAlexW2025412049MaRDI QIDQ2391130
Manlio Gaudioso, Enrico Gorgone, Maria Flavia Monaco
Publication date: 24 July 2009
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-009-0228-4
Related Items (9)
Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization ⋮ A method for convex minimization based on translated first-order approximations ⋮ An effective nonsmooth optimization algorithm for locally Lipschitz functions ⋮ A fast gradient and function sampling method for finite-max functions ⋮ Codifferential method for minimizing nonsmooth DC functions ⋮ Nonsmooth optimization: Theory and algorithms ⋮ Minimizing Piecewise-Concave Functions Over Polyhedra ⋮ A splitting bundle approach for non-smooth non-convex minimization ⋮ Optimal replenishment order placement in a finite time horizon
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- Computing proximal points of nonconvex functions
- Newton's method for convex programming and Tschebyscheff approximation
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- New variants of bundle methods
- An aggregate subgradient method for nonsmooth convex minimization
- The Cutting-Plane Method for Solving Convex Programs
- Optimization and nonsmooth analysis
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An Algorithm for Constrained Optimization with Semismooth Functions
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- An Incremental Method for Solving Convex Finite Min-Max Problems
- Convex Analysis
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
This page was built for publication: Piecewise linear approximations in nonconvex nonsmooth optimization
