Synthesis of cutting and separating planes in a nonsmooth optimization method

DOI10.1007/S10559-015-9753-6MaRDI QIDQ747314zbMATH OpenOpenAlexFDO

Authors Evgeniya A. Vorontsova, E. A. Nurminskii

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)

Recommendations

• On the possibility of applying smooth methods to the solution of non- smooth optimization problems
• Multiple Cuts in Separating Plane Algorithms
• Numerical methods for nondifferentiable convex optimization
• scientific article; zbMATH DE number 1778406
• Globally convergent cutting plane method for nonconvex nonsmooth minimization

Cites work

• scientific article; zbMATH DE number 3750660 (Why is no real title available?)
• scientific article; zbMATH DE number 3516928 (Why is no real title available?)
• scientific article; zbMATH DE number 3559294 (Why is no real title available?)
• scientific article; zbMATH DE number 3577030 (Why is no real title available?)
• scientific article; zbMATH DE number 1113627 (Why is no real title available?)
• scientific article; zbMATH DE number 3800430 (Why is no real title available?)
• scientific article; zbMATH DE number 3892037 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• scientific article; zbMATH DE number 3248677 (Why is no real title available?)
• scientific article; zbMATH DE number 3304564 (Why is no real title available?)
• A \(\mathcal{VU}\)-algorithm for convex minimization
• An aggregate subgradient method for nonsmooth convex minimization
• Benchmarking optimization software with performance profiles.
• Envelope stepsize control for iterative algorithms based on Fejér processes with attractants
• Introductory lectures on convex optimization. A basic course.
• Location of the Maximum on Unimodal Surfaces
• Models and information technologies for decision support during structural and technological changes
• New variants of bundle methods
• Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
• Separating plane algorithms for convex optimization
• Smooth minimization of non-smooth functions
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(2)

• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence
• Extended separating plane algorithm and NSO-solutions of PageRank problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q747314)