scientific article; zbMATH DE number 7594569

DOI10.11845/sxjz.2020050bMaRDI QIDQ5037959

Lu Shi, Jin-Bao Jian, Chun-Ming Tang

Publication date: 29 September 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

global convergencenonsmooth constrained optimizationbundle modificationtwo-phase bundle method

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52)

Uses Software

• GradSamp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
• Convex proximal bundle methods in depth: a unified analysis for inexact oracles
• A bundle modification strategy for convex minimization
• A bundle-filter method for nonsmooth convex constrained optimization
• A method of truncated codifferential with application to some problems of cluster analysis
• A feasible point method with bundle modification for nonsmooth convex constrained optimization
• Approximations in proximal bundle methods and decomposition of convex programs
• A multi-step doubly stabilized bundle method for nonsmooth convex optimization
• Methods of descent for nondifferentiable optimization
• A modified tunneling function method for non-smooth global optimization and its application in artificial neural network
• A proximal-projection partial bundle method for convex constrained minimax problems
• Tuning strategy for the proximity parameter in convex minimization
• Introduction to Nonsmooth Optimization
• The Cutting-Plane Method for Solving Convex Programs
• A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
• An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
• DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS
• Robust Formulations for Training Multilayer Perceptrons
• A feasible descent bundle method for inequality constrained Minimax problems
• A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
• An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
• Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction

This page was built for publication: