98 citations · 412 across the 57 of their papers we have counts for
7 papers · 1 filter
An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
Quoc Tran Dinh, Ion Necoara, Carlo Savorgnan +1
In this paper, we propose an inexact perturbed path-following algorithm in the framework of Lagrangian dual decomposition for solving large-scale structured convex optimization pro…
Combining Convex-Concave Decompositions and Linearization Approaches for solving BMIs, with application to Static Output Feedback
Quoc Tran Dinh, Suat Gumussoy, Wim Michiels +1
A novel optimization method is proposed to minimize a convex function subject to bilinear matrix inequality (BMI) constraints. The key idea is to decompose the bilinear mapping as…
Adjoint-based predictor-corrector sequential convex programming for parametric nonlinear optimization
Q. Tran Dinh, C. Savorgnan, M. Diehl
This paper proposes an algorithmic framework for solving parametric optimization problems which we call adjoint-based predictor-corrector sequential convex programming. After prese…
Sequential Convex Programming Methods for Solving Nonlinear Optimization Problems with DC constraints
Tran Dinh Quoc, Moritz Diehl
This paper investigates the relation between sequential convex programming (SCP) as, e.g., defined in [24] and DC (difference of two convex functions) programming. We first present…
Real-Time Sequential Convex Programming for Optimal Control Applications
Tran Dinh Quoc, Carlo Savorgnan, Moritz Diehl
This paper proposes real-time sequential convex programming (RTSCP), a method for solving a sequence of nonlinear optimization problems depending on an online parameter. We provide…
Proximal methods for minimizing the sum of a convex function and a composite function
Quoc Tran Dinh, Moritz Diehl
This paper extends the algorithm schemes proposed in \cite{Nesterov2007a} and \cite{Nesterov2007b} to the minimization of the sum of a composite objective function and a convex fun…