Global stability of first-order methods for coercive tame functions.
Math. Program., September, 2024
Sufficient Conditions for Instability of the Subgradient Method with Constant Step Size.
SIAM J. Optim., March, 2024
Global convergence of gradient descent for phase retrieval.
CoRR, 2024
Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients.
SIAM J. Optim., December, 2023
Publisher Correction to: Lyapunov stability of the subgradient method with constant step size.
Math. Program., November, 2023
Lyapunov stability of the subgradient method with constant step size.
Math. Program., November, 2023
Correction: Global convergence of the gradient method for functions definable in o-minimal structures.
Math. Program., November, 2023
Global convergence of the gradient method for functions definable in o-minimal structures.
Math. Program., November, 2023
Certifying the Absence of Spurious Local Minima at Infinity.
SIAM J. Optim., September, 2023
On the Absence of Spurious Local Trajectories in Time-Varying Nonconvex Optimization.
IEEE Trans. Autom. Control., 2023
Nonsmooth rank-one matrix factorization landscape.
Optim. Lett., 2022
Verifying Global Optimality of Candidate Solutions to Polynomial Optimization Problems using a Determinant Relaxation Hierarchy.
Proceedings of the 2021 60th IEEE Conference on Decision and Control (CDC), 2021
A survey on conic relaxations of optimal power flow problem.
Eur. J. Oper. Res., 2020
Absence of Spurious Local Trajectories in Time-Varying Optimization: A Control-Theoretic Perspective.
Proceedings of the 2020 IEEE Conference on Control Technology and Applications, 2020
Conic optimization for control, energy systems, and machine learning: Applications and algorithms.
Annu. Rev. Control., 2019
Sparse polynomial interpolation: sparse recovery, super-resolution, or Prony?
Adv. Comput. Math., 2019
Transient Stability Analysis of Power Systems via Occupation Measures.
Proceedings of the IEEE Power & Energy Society Innovative Smart Grid Technologies Conference, 2019
Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables.
SIAM J. Optim., 2018
How Much Restricted Isometry is Needed In Nonconvex Matrix Recovery?
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
A theory on the absence of spurious solutions for nonconvex and nonsmooth optimization.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018
Conic Optimization Theory: Convexification Techniques and Numerical Algorithms.
Proceedings of the 2018 Annual American Control Conference, 2018
Strong duality in Lasserre's hierarchy for polynomial optimization.
Optim. Lett., 2016
Computational analysis of sparsity-exploiting moment relaxations of the OPF problem.
Proceedings of the Power Systems Computation Conference, 2016
Moment relaxations of optimal power flow problems: Beyond the convex hull.
Proceedings of the 2016 IEEE Global Conference on Signal and Information Processing, 2016
Solution of optimal power flow problems using moment relaxations augmented with objective function penalization.
Proceedings of the 54th IEEE Conference on Decision and Control, 2015