A feasible point method with bundle modification for nonsmooth convex constrained optimization
From MaRDI portal
Publication:1753350
DOI10.1007/s10255-018-0755-9zbMath1391.90577OpenAlexW2800646568MaRDI QIDQ1753350
Lu Shi, Chun-Ming Tang, Jin-Bao Jian
Publication date: 29 May 2018
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-018-0755-9
Related Items
Unnamed Item ⋮ A new restricted memory level bundle method for constrained convex nonsmooth optimization ⋮ A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization ⋮ A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- 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
- Proximity control in bundle methods for convex nondifferentiable minimization
- A bundle-filter method for nonsmooth convex constrained optimization
- Newton's method for convex programming and Tschebyscheff approximation
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Variable metric bundle methods: From conceptual to implementable forms
- A method of truncated codifferential with application to some problems of cluster analysis
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Methods of descent for nondifferentiable optimization
- Tuning strategy for the proximity parameter in convex minimization
- A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization
- Level bundle methods for oracles with on-demand accuracy
- Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy Problems
- The Cutting-Plane Method for Solving Convex Programs
- Monotone Operators and the Proximal Point Algorithm
- 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
- A Proximal Bundle Method with Approximate Subgradient Linearizations
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
