Quoc Tran-Dinh

According to our database1, Quoc Tran-Dinh authored at least 38 papers between 2013 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
An Inexact Interior-Point Lagrangian Decomposition Algorithm with Inexact Oracles.
J. Optim. Theory Appl., 2020

A Unified Convergence Analysis for Shuffling-Type Gradient Methods.
CoRR, 2020

A Newton Frank-Wolfe Method for Constrained Self-Concordant Minimization.
CoRR, 2020

Composite convex optimization with global and local inexact oracles.
Comp. Opt. and Appl., 2020

Transferring Optimality Across Data Distributions via Homotopy Methods.
Proceedings of the 8th International Conference on Learning Representations, 2020

A Hybrid Stochastic Policy Gradient Algorithm for Reinforcement Learning.
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020

2019
Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs.
Math. Program. Comput., 2019

Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms.
Math. Program., 2019

Generalized self-concordant functions: a recipe for Newton-type methods.
Math. Program., 2019

Robust multicategory support matrix machines.
Math. Program., 2019

Using positive spanning sets to achieve stationarity with the Boosted DC Algorithm.
CoRR, 2019

A Hybrid Stochastic Optimization Framework for Stochastic Composite Nonconvex Optimization.
CoRR, 2019

ProxSARAH: An Efficient Algorithmic Framework for Stochastic Composite Nonconvex Optimization.
CoRR, 2019

Proximal alternating penalty algorithms for nonsmooth constrained convex optimization.
Comp. Opt. and Appl., 2019

Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence.
Comp. Opt. and Appl., 2019

Contraction Estimates for Abstract Real-Time Algorithms for NMPC.
Proceedings of the 58th IEEE Conference on Decision and Control, 2019

2018
A Smooth Primal-Dual Optimization Framework for Nonsmooth Composite Convex Minimization.
SIAM J. Optim., 2018

A Single-Phase, Proximal Path-Following Framework.
Math. Oper. Res., 2018

Non-Ergodic Alternating Proximal Augmented Lagrangian Algorithms with Optimal Rates.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization.
Optim. Lett., 2017

Adaptive smoothing algorithms for nonsmooth composite convex minimization.
Comp. Opt. and Appl., 2017

Smooth Primal-Dual Coordinate Descent Algorithms for Nonsmooth Convex Optimization.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
Simplicial Nonnegative Matrix Tri-factorization: Fast Guaranteed Parallel Algorithm.
Proceedings of the Neural Information Processing - 23rd International Conference, 2016

Frank-Wolfe works for non-Lipschitz continuous gradient objectives: Scalable poisson phase retrieval.
Proceedings of the 2016 IEEE International Conference on Acoustics, 2016

Convex Block-sparse Linear Regression with Expanders - Provably.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Composite self-concordant minimization.
J. Mach. Learn. Res., 2015

Structured Sparsity: Discrete and Convex approaches.
CoRR, 2015

A Universal Primal-Dual Convex Optimization Framework.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Composite Convex Minimization Involving Self-concordant-Like Cost Functions.
Proceedings of the Modelling, Computation and Optimization in Information Systems and Management Sciences - Proceedings of the 3rd International Conference on Modelling, Computation and Optimization in Information Systems and Management Sciences, 2015

A primal-dual framework for mixtures of regularizers.
Proceedings of the 23rd European Signal Processing Conference, 2015

WASP: Scalable Bayes via barycenters of subset posteriors.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014
Convexity in Source Separation : Models, geometry, and algorithms.
IEEE Signal Process. Mag., 2014

An Inexact Proximal Path-Following Algorithm for Constrained Convex Minimization.
SIAM J. Optim., 2014

Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC.
SIAM J. Control and Optimization, 2014

Constrained convex minimization via model-based excessive gap.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Barrier smoothing for nonsmooth convex minimization.
Proceedings of the IEEE International Conference on Acoustics, 2014

Scalable Sparse Covariance Estimation via Self-Concordance.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions.
Proceedings of the 30th International Conference on Machine Learning, 2013


  Loading...