Piecewise linear approximations in nonconvex nonsmooth optimization
From MaRDI portal
Publication:2391130
Recommendations
- Piecewise-quadratic approximations in convex numerical optimization
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A bundle-Newton method for nonsmooth unconstrained minimization
- A cutting plane and level stabilization bundle method with inexact data for minimizing nonsmooth nonconvex functions
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
Cites work
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- A numerically stable dual method for solving strictly convex quadratic programs
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- An aggregate subgradient method for nonsmooth convex minimization
- An Algorithm for Constrained Optimization with Semismooth Functions
- An Incremental Method for Solving Convex Finite Min-Max Problems
- Computing proximal points of nonconvex functions
- Convex Analysis
- Gobally convergent variable metric method for nonconvex nondifferentiable unconstrained minimization
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3577030 (Why is no real title available?)
- scientific article; zbMATH DE number 1534297 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- New variants of bundle methods
- Newton's method for convex programming and Tschebyscheff approximation
- Optimization and nonsmooth analysis
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- The Cutting-Plane Method for Solving Convex Programs
Cited in
(27)- Piecewise linear methods for nonlinear equations and optimization
- A method for convex minimization based on translated first-order approximations
- Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- A fast gradient and function sampling method for finite-max functions
- An effective nonsmooth optimization algorithm for locally Lipschitz functions
- An outer approximate subdifferential method for piecewise affine optimization
- Piecewise linear bounding functions in univariate global optimization
- An algorithm for nonsmooth optimization by successive piecewise linearization
- Optimal replenishment order placement in a finite time horizon
- Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
- On Lipschitz optimization based on gray-box piecewise linearization
- Piecewise-quadratic approximations in convex numerical optimization
- Piecewise-Linear Approximation Methods for Nonseparable Convex Optimization
- scientific article; zbMATH DE number 16310 (Why is no real title available?)
- Nonconvex approximations in unconstrained minimization
- Manifold sampling for optimization of nonconvex functions that are piecewise linear compositions of smooth components
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- scientific article; zbMATH DE number 864910 (Why is no real title available?)
- Generating set search methods for piecewise smooth problems
- Minimizing Piecewise-Concave Functions Over Polyhedra
- A splitting bundle approach for non-smooth non-convex minimization
- Codifferential method for minimizing nonsmooth DC functions
- An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
- The approximation algorithm for solving a sort of non-smooth programming
- Nonsmooth optimization: Theory and algorithms
This page was built for publication: Piecewise linear approximations in nonconvex nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391130)
