Composite convex optimization with global and local inexact oracles
DOI10.1007/s10589-020-00174-2zbMath1433.90117arXiv1808.02121OpenAlexW2886729308MaRDI QIDQ1986105
Tianxiao Sun, Ion Necoara, Quoc Tran Dinh
Publication date: 7 April 2020
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.02121
self-concordant functionscomposite convex minimizationinexact proximal Newton-type methodlocal and global inexact oraclesprimal-dual second-order method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Derivative-free methods and methods using generalized derivatives (90C56)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Distance-Weighted Discrimination
- Sparse inverse covariance estimation with the graphical lasso
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- First-order methods of smooth convex optimization with inexact oracle
- Inexact proximal Newton methods for self-concordant functions
- An inexact interior point method for \(L_{1}\)-regularized sparse covariance selection
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Interior-point Lagrangian decomposition method for separable convex optimization
- Introductory lectures on convex optimization. A basic course.
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Finite-sample analysis of \(M\)-estimators using self-concordance
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- Generalized self-concordant functions: a recipe for Newton-type methods
- Lectures on Modern Convex Optimization
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Smooth Optimization with Approximate Gradient
- Lectures on Stochastic Programming
- Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming
- Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions
- An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization
- Randomized Block Proximal Damped Newton Method for Composite Self-Concordant Minimization
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice
- Poisson Image Reconstruction With Hessian Schatten-Norm Regularization
- Composite Self-Concordant Minimization
- Convex Analysis
This page was built for publication: Composite convex optimization with global and local inexact oracles
