Projection onto the exponential cone: a univariate root-finding problem
From MaRDI portal
Publication:6175559
DOI10.1080/10556788.2021.2022147MaRDI QIDQ6175559
Publication date: 24 July 2023
Published in: Optimization Methods and Software (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Relative entropy optimization and its applications
- A new self-dual embedding method for convex programming
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization
- COSMO: a conic operator splitting method for convex conic problems
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- Extended Formulations in Mixed-Integer Convex Programming
- A short survey on Kantorovich
- Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach
This page was built for publication: Projection onto the exponential cone: a univariate root-finding problem