| Publication | Date of Publication | Type |
|---|
Optimization-aided construction of multivariate Chebyshev polynomials
Journal of Approximation Theory | 2024-12-11 | Paper |
Convergence rate analysis of the gradient descent–ascent method for convex–concave saddle-point problems
Optimization Methods & Software | 2024-11-28 | Paper |
The exact worst-case convergence rate of the alternating direction method of multipliers
Mathematical Programming. Series A. Series B | 2024-11-07 | Paper |
On the rate of convergence of the difference-of-convex algorithm (DCA)
Journal of Optimization Theory and Applications | 2024-09-02 | Paper |
Construction of Multivariate Polynomial Approximation Kernels via Semidefinite Programming
SIAM Journal on Optimization | 2023-06-07 | Paper |
Conditions for linear convergence of the gradient method for non-convex optimization
Optimization Letters | 2023-06-05 | Paper |
A predictor-corrector algorithm for semidefinite programming that uses the factor width cone
| 2023-01-16 | Paper |
Convergence rate analysis of randomized and cyclic coordinate descent for convex optimization through semidefinite programming
| 2022-12-23 | Paper |
Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
Optimization Methods & Software | 2022-12-20 | Paper |
Convergence rates of RLT and Lasserre-type hierarchies for the generalized moment problem over the simplex and the sphere
Optimization Letters | 2022-10-11 | Paper |
Convergence rate analysis of the gradient descent-ascent method for convex-concave saddle-point problems
| 2022-09-02 | Paper |
Simulated annealing for convex optimization: rigorous complexity analysis and practical perspectives
Journal of Optimization Theory and Applications | 2022-07-18 | Paper |
An Analytic Center Cutting Plane Method to Determine Complete Positivity of a Matrix
INFORMS Journal on Computing | 2022-06-30 | Paper |
The exact worst-case convergence rate of the alternating direction method of multipliers
| 2022-06-20 | Paper |
Convergence analysis of a Lasserre hierarchy of upper bounds for polynomial minimization on the sphere
Mathematical Programming. Series A. Series B | 2022-06-14 | Paper |
The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions
Optimization Letters | 2022-06-10 | Paper |
Minimum energy configurations on a toric lattice as a quadratic assignment problem
Discrete Optimization | 2022-06-09 | Paper |
Complexity Analysis of a Sampling-Based Interior Point Method for Convex Optimization
Mathematics of Operations Research | 2022-05-17 | Paper |
On the rate of convergence of the Difference-of-Convex Algorithm (DCA)
| 2021-09-28 | Paper |
Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
SIAM Journal on Optimization | 2020-08-18 | Paper |
A survey of semidefinite programming approaches to the generalized problem of moments and their error analysis
Association for Women in Mathematics Series | 2020-07-07 | Paper |
Distributionally robust optimization with polynomial densities: theory, models and algorithms
Mathematical Programming. Series A. Series B | 2020-06-15 | Paper |
Worst-Case Examples for Lasserre’s Measure–Based Hierarchy for Polynomial Optimization on the Hypercube
Mathematics of Operations Research | 2020-04-30 | Paper |
Comparison of Lasserre's measure-based bounds for polynomial optimization to bounds obtained by simulated annealing
Mathematics of Operations Research | 2020-03-12 | Paper |
Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy
Discrete Applied Mathematics | 2020-02-20 | Paper |
Minimum energy configurations on a toric lattice as a quadratic assignment problem
| 2019-08-02 | Paper |
Simulated annealing with hit-and-run for convex optimization: rigorous complexity analysis and practical perspectives for copositive programming
| 2019-07-04 | Paper |
Polynomial norms
SIAM Journal on Optimization | 2019-02-08 | Paper |
A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
Annals of Operations Research | 2018-08-13 | Paper |
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
Optimization Letters | 2017-11-09 | Paper |
Bound-constrained polynomial optimization using only elementary calculations
Mathematics of Operations Research | 2017-09-22 | Paper |
On the convergence rate of grid search for polynomial optimization over the simplex
Optimization Letters | 2017-04-05 | Paper |
Convergence analysis for Lasserre's measure-based hierarchy of upper bounds for polynomial optimization
Mathematical Programming. Series A. Series B | 2017-03-23 | Paper |
Improved convergence rates for Lasserre-type hierarchies of upper bounds for box-constrained polynomial optimization
SIAM Journal on Optimization | 2017-03-10 | Paper |
Book review of: J.-B. Lasserre, An introduction to polynomial and semi-algebraic optimization
European Journal of Operational Research | 2016-10-07 | Paper |
On the Turing model complexity of interior point methods for semidefinite programming
SIAM Journal on Optimization | 2016-09-23 | Paper |
Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems
European Journal of Operational Research | 2016-06-24 | Paper |
Relaxations of combinatorial problems via association schemes
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
A new semidefinite programming relaxation for the quadratic assignment problem and its computational perspectives
INFORMS Journal on Computing | 2016-01-25 | Paper |
An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution
SIAM Journal on Optimization | 2015-08-18 | Paper |
An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex
Mathematical Programming. Series A. Series B | 2015-06-19 | Paper |
Book drawings of complete bipartite graphs
Discrete Applied Mathematics | 2014-03-27 | Paper |
Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
Structural and Multidisciplinary Optimization | 2013-10-25 | Paper |
Improved lower bounds on book crossing numbers of complete graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
On semidefinite programming bounds for graph bandwidth
Optimization Methods & Software | 2013-06-24 | Paper |
On semidefinite programming relaxations of maximum \(k\)-section
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
Improved lower bounds for the 2-page crossing numbers of \(K_{m,n}\) and \(K_n\) via semidefinite programming
SIAM Journal on Optimization | 2012-09-12 | Paper |
Improved semidefinite programming bounds for quadratic assignment problems with suitable symmetry
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
A new library of structured semidefinite programming instances
Optimization Methods & Software | 2012-05-16 | Paper |
On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
SIAM Journal on Optimization | 2012-01-09 | Paper |
On the complexity of computing the handicap of a sufficient matrix
Mathematical Programming. Series A. Series B | 2011-11-07 | Paper |
A comparison of lower bounds for the symmetric circulant traveling salesman problem
Discrete Applied Mathematics | 2011-10-27 | Paper |
Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
Mathematical Programming. Series A. Series B | 2011-09-27 | Paper |
Error bounds for some semidefinite programming approaches to polynomial minimization on the hypercube
SIAM Journal on Optimization | 2011-03-21 | Paper |
Erratum: On Semidefinite Programming Relaxations of the Traveling Salesman Problem
SIAM Journal on Optimization | 2010-06-01 | Paper |
Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
Optimization Methods & Software | 2010-05-21 | Paper |
Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Exploiting special structure in semidefinite programming: a survey of theory and applications
European Journal of Operational Research | 2009-12-10 | Paper |
Exploiting group symmetry in truss topology optimization
Optimization and Engineering | 2009-12-02 | Paper |
On Semidefinite Programming Relaxations of the Traveling Salesman Problem
SIAM Journal on Optimization | 2009-11-27 | Paper |
On the Lovász \(\vartheta\)-number of almost regular graphs with application to Erdős-Rényi graphs
European Journal of Combinatorics | 2009-06-17 | Paper |
The complexity of optimizing over a simplex, hypercube or sphere: a short survey
CEJOR. Central European Journal of Operations Research | 2008-09-03 | Paper |
On the complexity of optimization over the standard simplex
European Journal of Operational Research | 2008-07-10 | Paper |
A note on the stability number of an orthogonality graph
European Journal of Combinatorics | 2007-08-27 | Paper |
A linear programming reformulation of the standard quadratic optimization problem
Journal of Global Optimization | 2007-03-06 | Paper |
Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
A PTAS for the minimization of polynomials of fixed degree over the simplex
Theoretical Computer Science | 2006-09-14 | Paper |
Improved Bounds for the Crossing Numbers of Km,n and Kn
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
Global optimization of rational functions: a semidefinite programming approach
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
Limiting behavior of the central path in semidefinite optimization
Optimization Methods & Software | 2005-08-25 | Paper |
On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
Positive Polynomials in Control | 2005-06-24 | Paper |
On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
Journal of Combinatorial Optimization | 2004-11-22 | Paper |
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
European Journal of Operational Research | 2004-08-16 | Paper |
On convex quadratic approximation
Statistica Neerlandica | 2004-06-15 | Paper |
Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
Journal of Global Optimization | 2003-06-18 | Paper |
scientific article; zbMATH DE number 1795723 (Why is no real title available?)
| 2003-06-18 | Paper |
On semidefinite programming relaxations of \((2+p)\)-SAT
Annals of Mathematics and Artificial Intelligence | 2003-03-10 | Paper |
On the Convergence of the Central Path in Semidefinite Optimization
SIAM Journal on Optimization | 2003-01-05 | Paper |
Aspects of semidefinite programming. Interior point algorithms and selected applications
Applied Optimization | 2002-05-29 | Paper |
Approximation of the stability number of a graph via copositive programming
SIAM Journal on Optimization | 2002-04-23 | Paper |
Relaxations of the satisfiability problem using semidefinite programming
| 2001-10-21 | Paper |
Relaxations of the satisfiability problem using semidefinite programming
Journal of Automated Reasoning | 2001-07-26 | Paper |
On copositive programming and standard quadratic optimization problems
Journal of Global Optimization | 2001-04-17 | Paper |
A scaled Gauss--Newton primal-dual search direction for semidefinite optimization
SIAM Journal on Optimization | 2001-03-19 | Paper |
scientific article; zbMATH DE number 1534291 (Why is no real title available?)
| 2000-11-22 | Paper |
Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions
Applied Numerical Mathematics | 1999-06-29 | Paper |
Polynomial primal-dual affine scaling algorithms in semidefinite programming
Journal of Combinatorial Optimization | 1999-05-05 | Paper |
A nonconvex weighted potential function for polynomial target following methods
Annals of Operations Research | 1998-11-08 | Paper |
scientific article; zbMATH DE number 1187124 (Why is no real title available?)
| 1998-10-28 | Paper |
scientific article; zbMATH DE number 1182578 (Why is no real title available?)
| 1998-08-02 | Paper |
Copositive realxation for genera quadratic programming
Optimization Methods & Software | 1998-06-02 | Paper |
Initialization in semidefinite programming via a self-dual skew-symmetric embedding
Operations Research Letters | 1998-03-02 | Paper |
Method of approximate centers for semi-definite programming
Optimization Methods & Software | 1997-07-23 | Paper |
scientific article; zbMATH DE number 1031414 (Why is no real title available?)
| 1997-07-06 | Paper |
Optimization of nuclear reactor reloading patterns
Annals of Operations Research | 1997-06-16 | Paper |
The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
| N/A | Paper |
