Access the full text.
Sign up today, get DeepDyve free for 14 days.
Chunming Tang, J. Jian (2012)
Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functionsEur. J. Oper. Res., 218
A. Frangioni, E. Gorgone (2013)
Bundle methods for sum-functions with “easy” components: applications to multicommodity network designMathematical Programming, 145
Frank Curtis, M. Overton (2012)
A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained OptimizationSIAM J. Optim., 22
B. Rustem, Q. Nguyen (1998)
An Algorithm for the Inequality-Constrained Discrete Min-Max ProblemSIAM J. Optim., 8
C. Lemaréchal, C. Sagastizábal (1997)
Variable metric bundle methods: From conceptual to implementable formsMathematical Programming, 76
J. Hiriart-Urruty, C. Lemaréchal (1993)
Convex analysis and minimization algorithms
C. Lemaréchal (1975)
An extension of davidon methods to non differentiable problems
A. Fuduli, M. Gaudioso (2006)
Tuning Strategy for the Proximity Parameter in Convex MinimizationJournal of Optimization Theory and Applications, 130
J.E. Kelley (1960)
The cutting-plane method for solving convex programsJ. Mach. Learn. Res., 8
Franziska Wulf (2016)
Minimization Methods For Non Differentiable Functions
W. Oliveira, C. Sagastizábal, C. Lemaréchal (2014)
Convex proximal bundle methods in depth: a unified analysis for inexact oraclesMathematical Programming, 148
Chunming Tang, Shuai Liu, J. Jian, Jianling Li (2012)
A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimizationNumerical Algorithms, 65
J. Burke, A. Lewis, M. Overton (2005)
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex OptimizationSIAM J. Optim., 15
K. Kiwiel (1991)
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimizationMathematical Programming, 52
K. Kiwiel (1985)
Methods of Descent for Nondifferentiable Optimization
A. Fuduli, M. Gaudioso (2006)
Tuning strategy for the proximity parameter in convex minimizationJ. Global Optim., 130
T. Kärkkäinen, E. Heikkola (2004)
Robust Formulations for Training Multilayer PerceptronsNeural Computation, 16
C. Sagastizábal, M. Solodov (2005)
An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a FilterSIAM J. Optim., 16
V. Demyanov, A. Bagirov, A. Rubinov (2002)
A method of truncated codifferential with application to some problems of cluster analysisJournal of Global Optimization, 23
P. Wolfe (1974)
Note on a method of conjugate subgradients for minimizing nondifferentiable functionsMathematical Programming, 7
(2000)
Test problems for nonsmooth unconstrained and linearly constrained optimization
J. Jinbao, Tang Chunming, Tang Fei (2015)
A feasible descent bundle method for inequality constrained Minimax problems, 45
W. Ackooij, C. Sagastizábal (2014)
Constrained Bundle Methods for Upper Inexact Oracles with Application to Joint Chance Constrained Energy ProblemsSIAM J. Optim., 24
R. Rockafellar (1976)
Monotone Operators and the Proximal Point AlgorithmSiam Journal on Control and Optimization, 14
N. Karmitsa (2007)
Test problems for large-scale nonsmooth minimization
A. Demyanov, A. Fuduli, G. Miglionico (2007)
A bundle modification strategy for convex minimizationEur. J. Oper. Res., 180
K. Kiwiel (1990)
Proximity control in bundle methods for convex nondifferentiable minimizationMathematical Programming, 46
(1993)
Number 305-306 in Grundlehren der mathematischen Wissenschaften
J. Kelley (1960)
The Cutting-Plane Method for Solving Convex ProgramsJournal of The Society for Industrial and Applied Mathematics, 8
J. Bonnans, Jean Gilbert, C. Lemaréchal, C. Sagastizábal (2003)
Numerical Optimization: Theoretical and Practical Aspects
F. Clarke, Yu. Ledyaev, R. Stern, P. Wolenski (1998)
Nonsmooth analysis and control theory
(1959)
Newton’s method for convex programming and Tchebycheff approximations
M. Nikolova, M. Ng, Chi-Pan Tam (2010)
Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and ReconstructionIEEE Transactions on Image Processing, 19
E. Karas, A. Ribeiro, C. Sagastizábal, M. Solodov (2008)
A bundle-filter method for nonsmooth convex constrained optimizationMathematical Programming, 116
W. Oliveira, C. Sagastizábal (2014)
Level bundle methods for oracles with on-demand accuracyOptimization Methods and Software, 29
K. Kiwiel (2006)
A Proximal Bundle Method with Approximate Subgradient LinearizationsSIAM J. Optim., 16
P. Rey, C. Sagastizábal (2002)
DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODSOptimization, 51
In this paper, a bundle modification strategy is proposed for nonsmooth convex constrained minimization problems. As a result, a new feasible point bundle method is presented by applying this strategy. Whenever the stability center is updated, some points in the bundle will be substituted by new ones which have lower objective values and/or constraint values, aiming at getting a better bundle. The method generates feasible serious iterates on which the objective function is monotonically decreasing. Global convergence of the algorithm is established, and some preliminary numerical results show that our method performs better than the standard feasible point bundle method.
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Apr 26, 2018
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.