| Publication | Date of Publication | Type |
|---|
| Coordinate descent methods beyond smoothness and separability | 2024-05-07 | Paper |
| Efficiency of higher-order algorithms for minimizing composite functions | 2024-02-16 | Paper |
| Random Coordinate Descent Methods for Nonseparable Composite Optimization | 2023-08-23 | Paper |
| Complexity of linearized augmented Lagrangian for optimization with nonlinear equality constraints | 2023-01-19 | Paper |
| Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems | 2023-01-09 | Paper |
| Stochastic block projection algorithms with extrapolation for convex feasibility problems | 2022-12-20 | Paper |
| Randomized sketch descent methods for non-separable linearly constrained optimization | 2022-05-17 | Paper |
| Model reduction with pole-zero placement and high order moment matching | 2022-04-08 | Paper |
| Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities | 2021-08-09 | Paper |
| General convergence analysis of stochastic first-order methods for composite optimization | 2021-06-15 | Paper |
| $H_2$ Model Reduction of Linear Network Systems by Moment Matching and Optimization | 2021-03-12 | Paper |
| General higher-order majorization-minimization algorithms for (non)convex optimization | 2020-10-26 | Paper |
| Composite convex optimization with global and local inexact oracles | 2020-04-07 | Paper |
| Faster Randomized Block Kaczmarz Algorithms | 2019-12-09 | Paper |
| Random minibatch subgradient algorithms for convex problems with functional constraints | 2019-11-20 | Paper |
| Linear convergence of dual coordinate descent on non-polyhedral convex problems | 2019-11-14 | Paper |
| Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates | 2019-11-08 | Paper |
| A Globally Convergent Penalty-Based Gauss-Newton Algorithm with Applications | 2019-05-21 | Paper |
| Linear convergence of first order methods for non-strongly convex optimization | 2019-05-17 | Paper |
| Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming | 2019-02-18 | Paper |
| H2 model reduction of linear network systems by moment matching and optimization | 2019-02-08 | Paper |
| Almost surely constrained convex optimization | 2019-01-31 | Paper |
| On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization | 2018-12-04 | Paper |
| Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization | 2018-11-22 | Paper |
| Optimal H2 moment matching-based model reduction for linear systems by (non)convex optimization | 2018-11-18 | Paper |
| Improved Dual Decomposition Based Optimization for DSL Dynamic Spectrum Management | 2018-07-09 | Paper |
| Randomized projection methods for convex feasibility problems: conditioning and convergence rates | 2018-01-15 | Paper |
| On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems | 2018-01-12 | Paper |
| Random Coordinate Descent Algorithms for Multi-Agent Convex Optimization Over Networks | 2017-09-08 | Paper |
| Random block coordinate descent methods for linearly constrained optimization over networks | 2017-09-01 | Paper |
| Every Continuous Nonlinear Control System Can be Obtained by Parametric Convex Programming | 2017-08-08 | Paper |
| Application of a Smoothing Technique to Decomposition in Convex Optimization | 2017-08-08 | Paper |
| Finite-Horizon Min–Max Control of Max-Plus-Linear Systems | 2017-07-27 | Paper |
| Constructive solution of inverse parametric linear/quadratic programming problems | 2017-06-22 | Paper |
| Random Coordinate Descent Methods for <inline-formula> <tex-math notation="TeX">$\ell_{0}$</tex-math></inline-formula> Regularized Convex Optimization | 2017-05-16 | Paper |
| Rate Analysis of Inexact Dual First-Order Methods Application to Dual Decomposition | 2017-05-16 | Paper |
| Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization | 2017-04-05 | Paper |
| Iteration complexity analysis of dual first-order methods for conic convex programming | 2016-06-29 | Paper |
| Complexity Certifications of First-Order Inexact Lagrangian Methods for General Convex Programming: Application to Real-Time MPC | 2016-04-13 | Paper |
| Fully Inverse Parametric Linear/Quadratic Programming Problems via Convex Liftings | 2016-04-13 | Paper |
| Fast inexact decomposition algorithms for large-scale separable convex optimization | 2016-03-08 | Paper |
| An adaptive constraint tightening approach to linear model predictive control based on approximation algorithms for optimization | 2016-02-11 | Paper |
| Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds | 2016-01-21 | Paper |
| Computational complexity certification for dual gradient method: application to embedded MPC | 2015-11-23 | Paper |
| DuQuad: an inexact (augmented) dual first order algorithm for quadratic programming | 2015-04-22 | Paper |
| Computational Complexity of Inexact Gradient Augmented Lagrangian Methods: Application to Constrained MPC | 2015-02-09 | Paper |
| Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization | 2015-01-16 | Paper |
| Smoothing Techniques-Based Distributed Model Predictive Control Algorithms for Networks | 2014-10-24 | Paper |
| A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints | 2014-10-10 | Paper |
| Path-following gradient-based decomposition algorithms for separable convex optimization | 2014-07-03 | Paper |
| Iteration complexity analysis of random coordinate descent methods for $\ell_0$ regularized convex problems | 2014-03-26 | Paper |
| Stabilization of max-plus-linear systems using model predictive control: the unconstrained case | 2014-03-19 | Paper |
| Distributed dual gradient methods and error bound conditions | 2014-01-17 | Paper |
| An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization | 2013-06-27 | Paper |
| Distributed model predictive control of leader-follower systems using an interior point method with efficient computations | 2013-02-24 | Paper |
| Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC | 2013-02-13 | Paper |
| Parallel and distributed optimization methods for estimation and control in networks | 2013-02-13 | Paper |
| Rate analysis of inexact dual first order methods: Application to distributed MPC for network systems | 2013-02-13 | Paper |
| Interior-point Lagrangian decomposition method for separable convex optimization | 2010-02-15 | Paper |
| Robust control of constrained max-plus-linear systems | 2009-05-14 | Paper |
| Model predictive control for uncertain max–min-plus-scaling systems | 2008-12-01 | Paper |
| A Jacobi algorithm for distributed model predictive control of dynamically coupled systems | 2008-09-22 | Paper |
| Stable model predictive control for constrained max-plus-linear systems | 2008-01-07 | Paper |
| Efficiency of stochastic coordinate proximal gradient methods on nonseparable composite optimization | 0001-01-03 | Paper |
| Stochastic subgradient for composite optimization with functional constraints | 0001-01-03 | Paper |
| Convergence analysis of stochastic higher-order majorization-minimization algorithms | 0001-01-03 | Paper |
| Acceleration and restart for the randomized Bregman-Kaczmarz method | 0001-01-03 | Paper |
| Higher-order tensor methods for minimizing difference of convex functions | 0001-01-03 | Paper |
| Exact representation and efficient approximations of linear model predictive control laws via HardTanh type deep neural networks | 0001-01-03 | Paper |
| Mini-batch stochastic subgradient for functional constrained optimization | 0001-01-03 | Paper |
| Proximal gradient methods with inexact oracle of degree q for composite optimization | 0001-01-03 | Paper |
| A stochastic moving ball approximation method for smooth convex constrained minimization | 0001-01-03 | Paper |
| Moving higher-order Taylor approximations method for smooth constrained minimization problems | 0001-01-03 | Paper |
| Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints | 0001-01-03 | Paper |
