Radial duality. II: Applications and algorithms
From MaRDI portal
Abstract: The first part of this work established the foundations of a radial duality between nonnegative optimization problems, inspired by the work of (Renegar, 2016). Here we utilize our radial duality theory to design and analyze projection-free optimization algorithms that operate by solving a radially dual problem. In particular, we consider radial subgradient, smoothing, and accelerated methods that are capable of solving a range of constrained convex and nonconvex optimization problems and that can scale-up more efficiently than their classic counterparts. These algorithms enjoy the same benefits as their predecessors, avoiding Lipschitz continuity assumptions and costly orthogonal projections, in our newfound, broader context. Our radial duality further allows us to understand the effects and benefits of smoothness and growth conditions on the radial dual and consequently on our radial algorithms.
Recommendations
Cites work
- ``Efficient subgradient methods for general convex optimization
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Accelerated first-order methods for hyperbolic programming
- Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
- An adversarial optimization approach to efficient outlier removal
- Convex Approximations of Chance Constrained Programs
- Cubic regularization of Newton method and its global performance
- Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
- Duality in quadratic programming
- Faster subgradient methods for functions with Hölderian growth
- From error bounds to the complexity of first-order descent methods for convex functions
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 1089159 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- Image deblurring with Poisson data: from cells to galaxies
- Least Median of Squares Regression
- Minimization of unsmooth functionals
- Nearly unbiased variable selection under minimax concave penalty
- On gradients of functions definable in o-minimal structures
- On semi- and subanalytic geometry
- OSQP: an operator splitting solver for quadratic programs
- Radial subgradient method
- Robust optimization approximation for joint chance constrained optimization problem
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity
- Sharpness, restart, and acceleration
- Smooth minimization of non-smooth functions
- Smoothing and first order methods: a unified framework
- Stochastic model-based minimization of weakly convex functions
- The space of star-shaped sets and its applications in nonsmooth optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Thin partitions, isoperimetric inequalities and a sampling algorithm for star shaped bodies
- Universal gradient methods for convex optimization problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Weak Sharp Minima in Mathematical Programming
Cited in
(2)
This page was built for publication: Radial duality. II: Applications and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126645)
