An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
From MaRDI portal
Publication:5317553
DOI10.1137/040603875zbMath1114.90093MaRDI QIDQ5317553
Claudia A. Sagastizábal, Mikhail V. Solodov
Publication date: 16 September 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040603875
65K05: Numerical mathematical programming methods
90C25: Convex programming
49J52: Nonsmooth analysis
Related Items
A sharp augmented Lagrangian-based method in constrained non-convex optimization, Unnamed Item, A splitting bundle approach for non-smooth non-convex minimization, On the generalization of ECP and OA methods to nonsmooth convex MINLP problems, A proximal bundle method for nonsmooth nonconvex functions with inexact information, A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization, Unnamed Item, A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information, A version of bundle trust region method with linear programming, Optimal Convergence Rates for the Proximal Bundle Method, A doubly stabilized bundle method for nonsmooth convex optimization, Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems, Solving generation expansion planning problems with environmental constraints by a bundle method, A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization, Level bundle methods for constrained convex optimization with various oracles, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, Diagonal bundle method for nonsmooth sparse optimization, Optimality conditions and a method of centers for minimax fractional programs with difference of convex functions, A variable metric method for nonsmooth convex constrained optimization, A bundle-filter method for nonsmooth convex constrained optimization, A filter-variable-metric method for nonsmooth convex constrained optimization, An inexact bundle variant suited to column generation, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, A feasible point method with bundle modification for nonsmooth convex constrained optimization, A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods, A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, 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 feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming, A penalty-free method with superlinear convergence for equality constrained optimization, An incremental bundle method for portfolio selection problem under second-order stochastic dominance, Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality, A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems, A proximal-projection partial bundle method for convex constrained minimax problems, An approximate proximal bundle method to minimize a class of maximum eigenvalue functions, A simple version of bundle method with linear programming, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, Optimistic planning algorithms for state-constrained optimal control problems, A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems, Spectral projected subgradient method for nonsmooth convex optimization problems, An implementation of a reduced subgradient method via Luenberger-Mokhtar variant, Diagonal discrete gradient bundle method for derivative free nonsmooth optimization, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, Subgradient and Bundle Methods for Nonsmooth Optimization, Comparing different nonsmooth minimization methods and software, An Algorithm Using Trust Region Strategy for Minimization of a Nondifferentiable Function, Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization
Uses Software
