Generalized cutting plane method for solving nonlinear stochastic programming problems
From MaRDI portal
Publication:5131826
DOI10.1080/02331934.2019.1711081zbMath1453.90126OpenAlexW3000494714MaRDI QIDQ5131826
Publication date: 9 November 2020
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2019.1711081
generalized convexitycutting plane methoddegree-one calm functionsminimum-type subgradientstwo-stage nonconvex programming problems
Nonconvex programming, global optimization (90C26) Stochastic programming (90C15) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization of the difference of topical functions
- Solving DC programs using the cutting angle method
- Optimization of the difference of ICR functions
- Minimizing increasing star-shaped functions based on abstract convexity
- Cutting angle method and a local search
- Radiant separation theorems and minimum-type subdifferentials of calm functions
- Cutting angle methods in global optimization
- Global minimization of the difference of strictly non-positive valued affine ICR functions
- The modified cutting angle method for global minimization of increasing positively homogeneous functions over the unit simplex
- Cutting angle method – a tool for constrained global optimization
- Lectures on Stochastic Programming
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- Geometry and combinatorics of the cutting angle method
- On ℋn+1-convex functions: asymptotic behaviour and subdifferentials
- Lipschitz programming via increasing convex-along-rays functions*
- Convex Analysis
- Abstract convexity and global optimization
This page was built for publication: Generalized cutting plane method for solving nonlinear stochastic programming problems