An optimal subgradient algorithm for large-scale bound-constrained convex optimization
From MaRDI portal
Publication:2408897
Abstract: This paper shows that the OSGA algorithm -- which uses first-order information to solve convex optimization problems with optimal complexity -- can be used to efficiently solve arbitrary bound-constrained convex optimization problems. This is done by constructing an explicit method as well as an inexact scheme for solving the bound-constrained rational subproblem required by OSGA. This leads to an efficient implementation of OSGA on large-scale problems in applications arising signal and image processing, machine learning and statistics. Numerical experiments demonstrate the promising performance of OSGA on such problems. ions to show the efficiency of the proposed scheme. A software package implementing OSGA for bound-constrained convex problems is available.
Recommendations
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- OSGA: a fast subgradient algorithm with optimal complexity
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- ``Efficient subgradient methods for general convex optimization
Cites work
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- A Limited Memory Algorithm for Bound Constrained Optimization
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- A New Active Set Algorithm for Box Constrained Optimization
- A Nonnegatively Constrained Convex Programming Method for Image Reconstruction
- A polynomially bounded algorithm for a singly constrained quadratic program
- A primal-dual splitting algorithm for finding zeros of sums of maximal monotone operators
- A reduced Newton method for constrained linear least-squares problems
- A Subspace, Interior, and Conjugate Gradient Method for Large-Scale Bound-Constrained Minimization Problems
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An introduction to total variation for image analysis
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Constrained total variation deblurring models and fast algorithms based on alternating direction method of multipliers
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- Introduction to Numerical Analysis
- Introductory lectures on convex optimization. A basic course.
- Limited memory bundle method for large bound constrained nonsmooth optimization: convergence analysis
- LMBOPT: a limited memory method for bound-constrained optimization
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Newton's Method for Large Bound-Constrained Optimization Problems
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- OSGA: a fast subgradient algorithm with optimal complexity
- Proximal linearized alternating direction method for multiplicative denoising
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- Smooth minimization of non-smooth functions
- Solving Ill-Conditioned and Singular Linear Systems: A Tutorial on Regularization
- Solving regularized linear least-squares problems by the alternating direction method with applications to image restoration
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Sparse Reconstruction by Separable Approximation
- Tackling box-constrained optimization via a new projected quasi-Newton approach
- The Limited Memory Conjugate Gradient Method
Cited in
(9)- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- OSGA: a fast subgradient algorithm with optimal complexity
- scientific article; zbMATH DE number 1264398 (Why is no real title available?)
- Impulse noise removal by an adaptive trust-region method
This page was built for publication: An optimal subgradient algorithm for large-scale bound-constrained convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2408897)
