Radial duality. II: Applications and algorithms

DOI10.1007/s10107-023-01974-0arXiv2104.11185OpenAlexW3154249197MaRDI QIDQ6126645

Benjamin Grimmer

Publication date: 9 April 2024

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2104.11185

zbMATH Keywords

optimizationprojective transformationsconvexnonconvexnonsmoothfirst-order methodsprojection-free methods

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• OSQP: An Operator Splitting Solver for Quadratic Programs
• Nearly unbiased variable selection under minimax concave penalty
• Smooth minimization of non-smooth functions
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Universal gradient methods for convex optimization problems
• Robust optimization approximation for joint chance constrained optimization problem
• On gradients of functions definable in o-minimal structures
• On semi- and subanalytic geometry
• From error bounds to the complexity of first-order descent methods for convex functions
• Accelerated first-order methods for hyperbolic programming
• An adversarial optimization approach to efficient outlier removal
• Faster subgradient methods for functions with Hölderian growth
• Accelerated primal-dual gradient descent with linesearch for convex, nonconvex, and nonsmooth optimization problems
• Cubic regularization of Newton method and its global performance
• Smoothing and First Order Methods: A Unified Framework
• Weak Sharp Minima in Mathematical Programming
• Duality in quadratic programming
• Least Median of Squares Regression
• Image deblurring with Poisson data: from cells to galaxies
• The space of star-shaped sets and its applications in nonsmooth optimization
• Dual gauge programs, with applications to quadratic programming and the minimum-norm problem
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity
• Radial Subgradient Method
• Stochastic Model-Based Minimization of Weakly Convex Functions
• Sharpness, Restart, and Acceleration
• Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
• Convex Approximations of Chance Constrained Programs
• The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
• ``Efficient” Subgradient Methods for General Convex Optimization
• Minimization of unsmooth functionals
• A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications

This page was built for publication: Radial duality. II: Applications and algorithms