A \(\mathcal{VU}\)-algorithm for convex minimization
From MaRDI portal
Publication:2576737
DOI10.1007/s10107-005-0630-3zbMath1085.65051OpenAlexW2094993225MaRDI QIDQ2576737
Publication date: 14 December 2005
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0630-3
Numerical mathematical programming methods (65K05) Convex programming (90C25) Approximation methods and heuristics in mathematical programming (90C59) Methods of successive quadratic programming type (90C55)
Related Items (48)
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization ⋮ Nonsmoothness in machine learning: specific structure, proximal identification, and applications ⋮ A proximal method for composite minimization ⋮ The \(\mathcal{VU}\)-decomposition to the proper convex function ⋮ Partial Smoothness and Constant Rank ⋮ A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations ⋮ A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions ⋮ Composite proximal bundle method ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ A conjugate gradient sampling method for nonsmooth optimization ⋮ A space decomposition scheme for maximum eigenvalue functions and its applications ⋮ Computing proximal points of convex functions with inexact subgradients ⋮ On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition ⋮ On the local convergence analysis of the gradient sampling method for finite max-functions ⋮ Newton acceleration on manifolds identified by proximal gradient methods ⋮ Harnessing Structure in Composite Nonsmooth Minimization ⋮ An effective nonsmooth optimization algorithm for locally Lipschitz functions ⋮ The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications ⋮ The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function ⋮ A decomposition algorithm for convex nondifferentiable minimization with errors ⋮ Characterizations and applications of generalized invexity and monotonicity in Asplund spaces ⋮ Optimal Convergence Rates for the Proximal Bundle Method ⋮ Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification ⋮ A derivative-free 𝒱𝒰-algorithm for convex finite-max problems ⋮ Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ A decomposition method with redistributed subroutine for constrained nonconvex optimization ⋮ The space decomposition theory for a class of eigenvalue optimizations ⋮ Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization ⋮ Method of conjugate subgradients with constrained memory ⋮ Optimality, identifiability, and sensitivity ⋮ A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence ⋮ \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications ⋮ Derivative-free optimization via proximal point methods ⋮ A fast gradient and function sampling method for finite-max functions ⋮ A superlinear space decomposition algorithm for constrained nonsmooth convex program ⋮ An approximate decomposition algorithm for convex minimization ⋮ Derivative-free optimization methods for finite minimax problems ⋮ Incremental-like bundle methods with application to energy planning ⋮ The chain rule for VU-decompositions of nonsmooth functions ⋮ Generic Minimizing Behavior in Semialgebraic Optimization ⋮ Functions and sets of smooth substructure: relationships and examples ⋮ Essentials of numerical nonsmooth optimization ⋮ Synthesis of cutting and separating planes in a nonsmooth optimization method ⋮ Active‐Set Newton Methods and Partial Smoothness ⋮ Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems ⋮ Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods ⋮ Essentials of numerical nonsmooth optimization ⋮ On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some numerical experiments with variable-storage quasi-Newton algorithms
- On the limited memory BFGS method for large scale optimization
- Applications of second-order cone programming
- Newton's method for convex programming and Tschebyscheff approximation
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Convergence of some algorithms for convex minimization
- Representations of quasi-Newton matrices and their use in limited memory methods
- Variable metric bundle methods: From conceptual to implementable forms
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Globally convergent BFGS method for nonsmooth convex optimization
- A quasi-second-order proximal bundle algorithm
- Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods
- On superlinear convergence in univariate nonsmooth minimization
- On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
- 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
- Monotone Operators and the Proximal Point Algorithm
- BFGS with Update Skipping and Varying Memory
- Practical Aspects of the Moreau--Yosida Regularization: Theoretical Preliminaries
- Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- The 𝒰-Lagrangian of a convex function
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Numerical methods for nondifferentiable convex optimization
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
- Proximité et dualité dans un espace hilbertien
- A second-order bundle method to minimize the maximum eigenvalue function.
- Growth conditions and \(U\)-Lagrangians
This page was built for publication: A \(\mathcal{VU}\)-algorithm for convex minimization
