Newton-type Alternating Minimization Algorithm for Convex Optimization

DOI10.1109/TAC.2018.2872203zbMath1482.90158arXiv1803.05256OpenAlexW3099152187MaRDI QIDQ4629822

Panagiotis Patrinos, Lorenzo Stella, Andreas Themelis

Publication date: 28 March 2019

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Convex programming (90C25) Newton-type methods (49M15) Methods of quasi-Newton type (90C53)

Related Items (2)

Douglas-Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms ⋮ Massively parallelizable proximal algorithms for large‐scale stochastic optimal control problems

This page was built for publication: Newton-type Alternating Minimization Algorithm for Convex Optimization