From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization
From MaRDI portal
Abstract: The standard simplex in R^n, also known as the probability simplex, is the set of nonnegative vectors whose entries sum up to 1. They frequently appear as constraints in optimization problems that arise in machine learning, statistics, data science, operations research, and beyond. We convert the standard simplex to the unit sphere and thus transform the corresponding constrained optimization problem into an optimization problem on a simple, smooth manifold. We show that KKT points and strict-saddle points of the minimization problem on the standard simplex all correspond to those of the transformed problem, and vice versa. So, solving one problem is equivalent to solving the other problem. Then, we propose several simple, efficient, and projection-free algorithms using the manifold structure. The equivalence and the proposed algorithm can be extended to optimization problems with unit simplex, weighted probability simplex, or `1-norm sphere constraints. Numerical experiments between the new algorithms and existing ones show the advantages of the new approach
Recommendations
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- A derivative-free algorithm for spherically constrained optimization
- The complexity of optimizing over a simplex, hypercube or sphere: a short survey
- Deterministic approximation algorithms for sphere constrained homogeneous polynomial optimization problems
- Approximating parameterized convex optimization problems
- Approximating parameterized convex optimization problems
- Faster Lagrangian-based methods in convex optimization
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- A unifying polyhedral approximation framework for convex optimization
Cited in
(9)- Optimization over a probability simplex
- Anomaly detection in the probability simplex under different geometries
- Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints
- Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons
- Optimization over convex polyhedra via Hadamard parametrizations
- Simplex constrained sparse optimization via tail screening
- The effect of smooth parametrizations on nonconvex optimization landscapes
- Fast variable selection for distributional regression with application to continuous glucose monitoring data
- Characterizing the global optimum of a class of nonconvex optimization problems with a comparison of several algorithms
This page was built for publication: From the simplex to the sphere: faster constrained optimization using the Hadamard parametrization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164739)
