Convergence of some algorithms for convex minimization
From MaRDI portal
Publication:1321649
DOI10.1007/BF01585170zbMath0805.90083MaRDI QIDQ1321649
Rafael Correa, Claude Lemaréchal
Publication date: 28 April 1994
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
nondifferentiable optimizationbundle methodssubgradient optimizationconvergence of various minimization methodsprox-iteration schemessubgradient-descent type algorithms
Related Items
Primal-dual \(\varepsilon\)-subgradient method for distributed optimization, Optimal Convergence Rates for the Proximal Bundle Method, Principled analyses and design of first-order methods with inexact proximal operators, Minimizing and stationary sequences of convex constrained minimization problems, Subgradient method with feasible inexact projections for constrained convex optimization problems, A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems, Approximations in proximal bundle methods and decomposition of convex programs, DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS, Variable metric bundle methods: From conceptual to implementable forms, Convergence analysis of gradient descent stochastic algorithms, Sample-path optimization of convex stochastic performance functions, An approximate bundle method for solving nonsmooth equilibrium problems, Some convergence properties of descent methods, Composite proximal bundle method, Multivariate spectral gradient algorithm for nonsmooth convex optimization problems, A quasi-second-order proximal bundle algorithm, A quasi-Newton bundle method based on approximate subgradients, Fast proximal algorithms for nonsmooth convex optimization, A note on locally Lipschitzian functions, Solving generation expansion planning problems with environmental constraints by a bundle method, Coupling the proximal point algorithm with approximation methods, Convergence of a proximal algorithm for solving the dual of a generalized fractional program, Computing proximal points of convex functions with inexact subgradients, On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration, A simple version of bundle method with linear programming, Cutting plane oracles to minimize non-smooth non-convex functions, First-order methods of smooth convex optimization with inexact oracle, An efficient conjugate gradient method with strong convergence properties for non-smooth optimization, Descentwise inexact proximal algorithms for smooth optimization, A decomposition algorithm for convex nondifferentiable minimization with errors, Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs, Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization, Conjugate gradient type methods for the nondifferentiable convex minimization, Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods, A derivative-free 𝒱𝒰-algorithm for convex finite-max problems, Incremental Bundle Methods using Upper Models, A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., A subgradient method with non-monotone line search, A modified conjugate gradient method for general convex functions, A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs, Iteration-complexity of the subgradient method on Riemannian manifolds with lower bounded curvature, First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing, Performance of Some Approximate Subgradient Methods over Nonlinearly Constrained Networks, Convex proximal bundle methods in depth: a unified analysis for inexact oracles, First Order Methods for Optimization on Riemannian Manifolds, Approximate Subgradient Methods for Lagrangian Relaxations on Networks, A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization, On the proximal gradient algorithm with alternated inertia, Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice, Computing proximal points of nonconvex functions, A bundle method for solving equilibrium problems, A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs, 𝒱𝒰-smoothness and proximal point results for some nonconvex functions, A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm, An approximate decomposition algorithm for convex minimization, A decomposition method for convex minimization problems and its application., A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization, Nonsmooth nonconvex global optimization in a Banach space with a basis, Convergence of the approximate auxiliary problem method for solving generalized variational inequalities, Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions, Convergence analysis of a relaxed extragradient–proximal point algorithm application to variational inequalities, Approximate subgradient methods for nonlinearly constrained network flow problems, A filter proximal bundle method for nonsmooth nonconvex constrained optimization, An Inexact Bundle Algorithm for Nonconvex Nonsmooth Minimization in Hilbert Space, A new trust region algorithm for nonsmooth convex minimization, A strongly convergent proximal bundle method for convex minimization in Hilbert spaces, An inertial algorithm for DC programming, A Redistributed Bundle Algorithm for Generalized Variational Inequality Problems in Hilbert Spaces, Regularized decomposition of large scale block-structured robust optimization problems, An effective adaptive trust region algorithm for nonsmooth minimization, Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming, Projection Methods in Conic Optimization, Nesterov perturbations and projection methods applied to IMRT, Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization, An approximate bundle-type auxiliary problem method for solving generalized variational inequalities, A family of variable metric proximal methods, A proximal cutting plane method using Chebychev center for nonsmooth convex optimization, Lagrangean/surrogate relaxation for generalized assignment problems, An inexact bundle variant suited to column generation, Two ``well-known properties of subgradient optimization, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, Subgradient algorithm on Riemannian manifolds, Convergence analysis of some methods for minimizing a nonsmooth convex function, Scaling Techniques for $\epsilon$-Subgradient Methods, Convergence analysis of a proximal newton method1, An inexact proximal point method for solving generalized fractional programs, Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs, A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems, Subgradient methods for saddle-point problems, Globally convergent BFGS method for nonsmooth convex optimization, Efficiency of proximal bundle methods, Algorithms for quasiconvex minimization, On the projected subgradient method for nonsmooth convex optimization in a Hilbert space, Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints, A proximal approach to the inversion of ill-conditioned matrices, A \(\mathcal{VU}\)-algorithm for convex minimization, Nonsmooth optimization by successive abs-linearization in function spaces, Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems, A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations, Distributed optimization with inexact oracle, A doubly stabilized bundle method for nonsmooth convex optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- Newton's method for convex programming and Tschebyscheff approximation
- Convex functions, monotone operators and differentiability
- An aggregate subgradient method for nonsmooth convex minimization
- The Cutting-Plane Method for Solving Convex Programs
- A descent algorithm for nonsmooth convex optimization
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Numerical methods for nondifferentiable convex optimization
