An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization
From MaRDI portal
Publication:5245364
DOI10.1137/130944539zbMath1311.90104arXiv1311.1756OpenAlexW2011430287MaRDI QIDQ5245364
Volkan Cevher, Quoc Tran Dinh, Anastasios Kyrillidis
Publication date: 8 April 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1311.1756
constrained convex optimizationself-concordant barrierproximal-Newton methodinexact path-following algorithmtractable proximity
Convex programming (90C25) Applications of mathematical programming (90C90) Interior-point methods (90C51) General topics in the theory of algorithms (68W01)
Related Items
Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization, A New Homotopy Proximal Variable-Metric Framework for Composite Convex Minimization, Inexact successive quadratic approximation for regularized optimization, An inexact interior-point Lagrangian decomposition algorithm with inexact oracles, Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization, Generalized self-concordant analysis of Frank-Wolfe algorithms, Proximal extrapolated gradient methods for variational inequalities, Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems, A Coordinate-Descent Primal-Dual Algorithm with Large Step Size and Possibly Nonseparable Functions, Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization, Inexact proximal Newton methods for self-concordant functions, A Single-Phase, Proximal Path-Following Framework, Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms, On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels
Uses Software