Approximating parameterized convex optimization problems
From MaRDI portal
Publication:2933639
DOI10.1145/2390176.2390186zbMath1301.90070OpenAlexW2061810505MaRDI QIDQ2933639
Joachim Giesen, Martin Jaggi, Sören Laue
Publication date: 5 December 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.4831
Convex programming (90C25) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Related Items
Optimal parameter characterization of an enhanced mathematical model of solar photovoltaic cell/module using an improved white shark optimization algorithm ⋮ Homotopy continuation approaches for robust SV classification and regression ⋮ Unnamed Item ⋮ Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization ⋮ Conditional selective inference for robust regression and outlier detection using piecewise-linear homotopy continuation
