A feasible point method with bundle modification for nonsmooth convex constrained optimization
type: Item
instance of: scholarly article
title: A feasible point method with bundle modification for nonsmooth convex constrained optimization
zbMATH Open document ID: 1391.90577
author: Lu Shi
author: Jinbao Jian
author: Chun-Ming Tang
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2018-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6875696
zbMATH Keywords: nonsmooth optimization
zbMATH Keywords: feasible point method
zbMATH Keywords: bundle modification
zbMATH Keywords: global convergence
describes a project that uses: SLQP-GS
describes a project that uses: SQPlab
describes a project that uses: PLCP
describes a project that uses: GradSamp
MaRDI profile type: Publication
full work available at URL: s10255-018-0755-9
OpenAlex ID: W2800646568
cites work: Numerical optimization. Theoretical and practical aspects. Transl. from the French
cites work: A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
cites work: Newton's method for convex programming and Tschebyscheff approximation
cites work: Q4375488
cites work: A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
cites work: Level bundle methods for oracles with on-demand accuracy
cites work: A bundle modification strategy for convex minimization
cites work: A method of truncated codifferential with application to some problems of cluster analysis
cites work: Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design
cites work: Tuning strategy for the proximity parameter in convex minimization
cites work: Q3141900
cites work: A feasible descent bundle method for inequality constrained Minimax problems
cites work: A bundle-filter method for nonsmooth convex constrained optimization
cites work: Robust Formulations for Training Multilayer Perceptrons
cites work: The Cutting-Plane Method for Solving Convex Programs
cites work: Methods of descent for nondifferentiable optimization
cites work: Proximity control in bundle methods for convex nondifferentiable minimization
cites work: Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
cites work: A Proximal Bundle Method with Approximate Subgradient Linearizations
cites work: Q4132264
cites work: Variable metric bundle methods: From conceptual to implementable forms
cites work: Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
cites work: Convex proximal bundle methods in depth: a unified analysis for inexact oracles
cites work: DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
cites work: An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
cites work: Q5187067
cites work: Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
cites work: A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
cites work: Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
cites work: Q4146571
Wikidata QID: Q129908120
DOI: 10.1007/S10255-018-0755-9
Recommended article: Q5037959
Recommended article: Q4687879
Recommended article: Bundle method for nonconvex nonsmooth constrained optimization
Recommended article: Q3973313
Recommended article: A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
Recommended article: A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
Recommended article: Q2951638
Recommended article: An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
Recommended article: A proximal bundle method for nonsmooth and nonconvex constrained optimization
Recommended article: A bundle-filter method for nonsmooth convex constrained optimization
description: scientific article; zbMATH DE number 6875696