Synthesis of cutting and separating planes in a nonsmooth optimization method

DOI10.1007/s10559-015-9753-6zbMath1327.90225OpenAlexW2326002905MaRDI QIDQ747314

E. A. Nurminskii, Evgeniya A. Vorontsova

Publication date: 23 October 2015

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9753-6

zbMATH Keywords

convex optimizationcutting plane methodseparating plane method

Mathematics Subject Classification ID

Convex programming (90C25) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence

Cites Work

• Smooth minimization of non-smooth functions
• Models and information technologies for decision support during structural and technological changes
• Separating plane algorithms for convex optimization
• Introductory lectures on convex optimization. A basic course.
• New variants of bundle methods
• Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
• A \(\mathcal{VU}\)-algorithm for convex minimization
• An aggregate subgradient method for nonsmooth convex minimization
• The Cutting-Plane Method for Solving Convex Programs
• Envelope stepsize control for iterative algorithms based on Fejer processes with attractants
• Location of the Maximum on Unimodal Surfaces
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Synthesis of cutting and separating planes in a nonsmooth optimization method