The method of codifferential descent for convex and global piecewise affine optimization

DOI10.1080/10556788.2019.1571590zbMath1464.90096arXiv1807.05538OpenAlexW2883328360MaRDI QIDQ5859002

Maksim V. Dolgopolik

Publication date: 15 April 2021

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.05538

zbMATH Keywords

convex optimizationglobal optimality conditionscodifferentialmethod of codifferential descentpiecewise affine optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (4)

Equivalence of Two Optimality Conditions for Polyhedral Functions ⋮ Finding the set of global minimizers of a piecewise affine function ⋮ Nonlocal error bounds for piecewise affine functions ⋮ New global optimality conditions for nonsmooth DC optimization problems

Uses Software

• NESUN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smooth minimization of non-smooth functions
• A doubly stabilized bundle method for nonsmooth convex optimization
• OSGA: a fast subgradient algorithm with optimal complexity
• Gradient methods for minimizing composite functions
• Codifferential calculus in normed spaces
• Universal gradient methods for convex optimization problems
• Codifferential method for minimizing nonsmooth DC functions
• On global unconstrained minimization of the difference of polyhedral functions
• Conditions for global optimality. II
• Introductory lectures on convex optimization. A basic course.
• A method of truncated codifferential with application to some problems of cluster analysis
• A convergence analysis of the method of codifferential descent
• Aggregate codifferential method for nonsmooth DC optimization
• Methods of subdifferential and hypodifferential descent in the problem of constructing an integrally constrained program control
• A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems
• Abstract convex approximations of nonsmooth functions
• Direct Methods in the Parametric Moving Boundary Variational Problem
• Exact penalty functions in isoperimetric problems
• On the global convergence of a nonmonotone proximal bundle method for convex nonsmooth minimization
• Piecewise affine functions as a difference of two convex functions
• Lectures on Polytopes
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity
• Piecewise affine functions and polyhedral sets^∗
• Survey of Bundle Methods for Nonsmooth Optimization
• Finding the distance between ellipsoids
• A Proximal Bundle Method with Approximate Subgradient Linearizations

This page was built for publication: The method of codifferential descent for convex and global piecewise affine optimization