Daniel P. Robinson

Michael O'Neill

Math. Program., May, 2024

2023

A Nonsmooth Dynamical Systems Perspective on Accelerated Extensions of ADMM.

[BibT_eX]

[DOI]

Guilherme França

IEEE Trans. Autom. Control., May, 2023

A Stochastic-Gradient-based Interior-Point Algorithm for Solving Smooth Bound-Constrained Optimization Problems.

[BibT_eX]

[DOI]

Vyacheslav Kungurtsev

Qi Wang

CoRR, 2023

A Variance-Reduced and Stabilized Proximal Stochastic Gradient Method with Support Identification Guarantees for Structured Optimization.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

A Subspace Acceleration Method for Minimization Involving a Group Sparsity-Inducing Regularizer.

[BibT_eX]

[DOI]

Yutong Dai

SIAM J. Optim., 2022

Self-Representation Based Unsupervised Exemplar Selection in a Union of Subspaces.

[BibT_eX]

[DOI]

IEEE Trans. Pattern Anal. Mach. Intell., 2022

2021

What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Trust-Region Newton-CG with Strong Second-Order Complexity Guarantees for Nonconvex Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Sequential Quadratic Optimization for Nonlinear Equality Constrained Stochastic Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2021

Regional complexity analysis of algorithms for nonconvex smooth optimization.

[BibT_eX]

[DOI]

Math. Program., 2021

Boosting RANSAC via Dual Principal Component Pursuit.

[BibT_eX]

[DOI]

CoRR, 2021

A Nullspace Property for Subspace-Preserving Recovery.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Dual Principal Component Pursuit for Robust Subspace Learning: Theory and Algorithms for a Holistic Approach.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

Dual Principal Component Pursuit for Learning a Union of Hyperplanes: Theory and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020

A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization.

[BibT_eX]

[DOI]

Vyacheslav Kungurtsev

SIAM J. Optim., 2020

Conformal Symplectic and Relativistic Optimization.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Robust Homography Estimation via Dual Principal Component Pursuit.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 2020

2019

Exploiting negative curvature in deterministic and stochastic optimization.

[BibT_eX]

[DOI]

Math. Program., 2019

Basis Pursuit and Orthogonal Matching Pursuit for Subspace-preserving Recovery: Theoretical Analysis.

[BibT_eX]

[DOI]

Chong You

CoRR, 2019

Generalized Nullspace Property for Structurally Sparse Signals.

[BibT_eX]

[DOI]

CoRR, 2019

Gradient Flows and Accelerated Proximal Splitting Methods.

[BibT_eX]

[DOI]

Guilherme França

CoRR, 2019

A Linearly Convergent Method for Non-Smooth Non-Convex Optimization on the Grassmannian with Applications to Robust Subspace and Dictionary Learning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Noisy Dual Principal Component Pursuit.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Is an Affine Constraint Needed for Affine Subspace Clustering?

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE/CVF International Conference on Computer Vision, 2019

2018

Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization.

[BibT_eX]

[DOI]

Mohammadreza Samadi

SIAM J. Optim., 2018

FaRSA for ℓ1-regularized convex optimization: local convergence and numerical experience.

[BibT_eX]

[DOI]

Tianyi Chen

Optim. Methods Softw., 2018

Concise complexity analyses for trust region methods.

[BibT_eX]

[DOI]

Zachary Lubberts

Optim. Lett., 2018

Dual Principal Component Pursuit: Probability Analysis and Efficient Algorithms.

[BibT_eX]

[DOI]

CoRR, 2018

Sparse Recovery over Graph Incidence Matrices: Polynomial Time Guarantees and Location Dependent Performance.

[BibT_eX]

[DOI]

CoRR, 2018

A nonconvex formulation for low rank subspace clustering: algorithms and convergence analysis.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

Dual Principal Component Pursuit: Improved Analysis and Efficient Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

ADMM and Accelerated ADMM as Continuous Dynamical Systems.

[BibT_eX]

[DOI]

Guilherme França

Proceedings of the 35th International Conference on Machine Learning, 2018

A Scalable Exemplar-Based Subspace Clustering Algorithm for Class-Imbalanced Data.

[BibT_eX]

[DOI]

Proceedings of the Computer Vision - ECCV 2018, 2018

Sparse Recovery over Graph Incidence Matrices.

[BibT_eX]

[DOI]

Proceedings of the 57th IEEE Conference on Decision and Control, 2018

2017

A Reduced-Space Algorithm for Minimizing ℓ<sub>1</sub>-Regularized Convex Functions.

[BibT_eX]

[DOI]

Tianyi Chen

SIAM J. Optim., 2017

A stabilized SQP method: superlinear convergence.

[BibT_eX]

[DOI]

Vyacheslav Kungurtsev

Math. Program., 2017

A trust region algorithm with a worst-case iteration complexity of O(ϵ <sup>-3/2</sup>) for nonconvex optimization.

[BibT_eX]

[DOI]

Mohammadreza Samadi

Math. Program., 2017

An interior-point trust-funnel algorithm for nonlinear optimization.

[BibT_eX]

[DOI]

Math. Program., 2017

A Flexible ADMM Algorithm for Big Data Applications.

[BibT_eX]

[DOI]

Rachael Tappenden

J. Sci. Comput., 2017

A dual gradient-projection method for large-scale strictly convex quadratic problems.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2017

Provable Self-Representation Based Outlier Detection in a Union of Subspaces.

[BibT_eX]

[DOI]

Chong You

Proceedings of the 2017 IEEE Conference on Computer Vision and Pattern Recognition, 2017

2016

Adaptive augmented Lagrangian methods: algorithms and practical numerical experience.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2016

Trading-Off Cost of Deployment Versus Accuracy in Learning Predictive Models.

[BibT_eX]

[DOI]

Suchi Saria

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Scalable Sparse Subspace Clustering by Orthogonal Matching Pursuit.

[BibT_eX]

[DOI]

Chong You

Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition, 2016

Oracle Based Active Set Algorithm for Scalable Elastic Net Subspace Clustering.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Conference on Computer Vision and Pattern Recognition, 2016

A divide-and-conquer framework for large-scale subspace clustering.

[BibT_eX]

[DOI]

Proceedings of the 50th Asilomar Conference on Signals, Systems and Computers, 2016

2015

A Solver for Nonconvex Bound-Constrained Quadratic Optimization.

[BibT_eX]

[DOI]

Hassan Mohy-ud-Din

SIAM J. Optim., 2015

A Nonmonotone Filter SQP Method: Local Convergence and Numerical Results.

[BibT_eX]

[DOI]

Yueling Loh

SIAM J. Optim., 2015

An adaptive augmented Lagrangian method for large-scale constrained optimization.

[BibT_eX]

[DOI]

Hao Jiang

Math. Program., 2015

Primal-Dual Active-Set Methods for Large-Scale Optimization.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2015

A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization.

[BibT_eX]

[DOI]

Zheng Han

Comput. Optim. Appl., 2015

Sparse Subspace Clustering with Missing Entries.

[BibT_eX]

[DOI]

Congyuan Yang

Proceedings of the 32nd International Conference on Machine Learning, 2015

2014

A Filter Method with Unified Step Computation for Nonlinear Optimization.

[BibT_eX]

[DOI]

Yueling Loh

SIAM J. Optim., 2014

An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization.

[BibT_eX]

[DOI]

SIAM J. Optim., 2014

2013

Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

A Globally Convergent Stabilized SQP Method.

[BibT_eX]

[DOI]

SIAM J. Optim., 2013

Trajectory-following methods for large-scale degenerate convex quadratic programming.

[BibT_eX]

[DOI]

Dominique Orban

Math. Program. Comput., 2013

2012

A primal-dual augmented Lagrangian.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2012

2010

A Second Derivative SQP Method: Local Convergence and Practical Issues.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

A Second Derivative SQP Method: Global Convergence.

[BibT_eX]

[DOI]

SIAM J. Optim., 2010

On solving trust-region and other regularised subproblems in optimization.

[BibT_eX]

[DOI]