An approximate bundle method for non-convex optimization and its dual problem

DOI10.11721/CQNUJ20160116zbMATH Open1363.90198MaRDI QIDQ2823697FDOQ2823697

Authors: Jie Shen, Xiaoqian Liu, Ying Chen, Xi Jin 

Publication date: 6 October 2016

Published in: Journal of Chongqing Normal University. Natural Science (Search for Journal in Brave)

Recommendations

• Bundle method for nonconvex nonsmooth constrained optimization
• An implementable bundle method for nonsmooth convex optimization
• A doubly stabilized bundle method for nonsmooth convex optimization
• scientific article; zbMATH DE number 16626
• A hybrid bundle method for nonsmooth convex optimization
• A proximal bundle method for nonsmooth and nonconvex constrained optimization
• An approximate bundle method for solving nonsmooth equilibrium problems
• scientific article; zbMATH DE number 3846333
• A proximal bundle method for a class of nonconvex nonsmooth composite optimization problems
• A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems

zbMATH Keywords

Lagrange dual problembundle methodnon-smooth non-convex optimizationapproximate function value

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26)

Cited In (5)

• A Bundle Method for a Class of Bilevel Nonsmooth Convex Minimization Problems
• An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space
• An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information
• Title not available (Why is that?)
• Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates

This page was built for publication: An approximate bundle method for non-convex optimization and its dual problem

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