| Publication | Date of Publication | Type |
|---|
Verifying robustness of neural networks with tight semidefinite relaxations
Computational Optimization and Applications | 2026-05-11 | Paper |
Stochastic gradient Hamiltonian sequential Monte Carlo filter with Earth Mover's Distance sampling for target tracking
Automatica | 2025-12-15 | Paper |
An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c
Optimization Letters | 2025-11-26 | Paper |
Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations
Journal of Global Optimization | 2025-06-27 | Paper |
Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs
Mathematical Methods of Operations Research | 2025-03-18 | Paper |
Strong duality of a conic optimization problem with a single hyperplane and two cone constraints
Optimization | 2025-01-30 | Paper |
Further development in convex conic reformulation of geometric nonconvex conic optimization problems
SIAM Journal on Optimization | 2024-10-22 | Paper |
| Exact Matrix Completion via High-Rank Matrices in Sum-of-Squares Relaxations | 2023-11-24 | Paper |
| Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems | 2023-08-10 | Paper |
Exact SDP relaxations for quadratic programs with bipartite graph structures
Journal of Global Optimization | 2023-07-13 | Paper |
| Equivalent Sufficient Conditions for Global Optimality of Quadratically Constrained Quadratic Program | 2023-03-10 | Paper |
| The Largest Unsolved QAP Instance Tai256c Can Be Converted into A 256-dimensional Simple BQOP with A Single Cardinality Constraint | 2022-10-28 | Paper |
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
Mathematical Programming. Series A. Series B | 2022-06-14 | Paper |
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Journal of Global Optimization | 2022-03-15 | Paper |
| Strong duality of a conic optimization problem with a single hyperplane and two cone constraints | 2021-11-05 | Paper |
| Generating Cutting Inequalities Successively for Quadratic Optimization Problems in Binary Variables | 2021-07-19 | Paper |
A Newton-bracketing method for a simple conic optimization problem
Optimization Methods & Software | 2021-07-06 | Paper |
| Lagrangian-conic relaxations. II: Applications to polynomial optimization problems | 2021-02-19 | Paper |
| Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems | 2021-02-03 | Paper |
| Solving Challenging Large Scale QAPs | 2021-01-23 | Paper |
Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
Journal of Global Optimization | 2020-05-26 | Paper |
A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
SIAM Journal on Optimization | 2020-05-20 | Paper |
Algorithm 996
ACM Transactions on Mathematical Software | 2020-04-24 | Paper |
A dual spectral projected gradient method for log-determinant semidefinite problems
Computational Optimization and Applications | 2020-04-07 | Paper |
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods
Journal of Global Optimization | 2019-12-03 | Paper |
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems
Computational Optimization and Applications | 2019-11-22 | Paper |
Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
Journal of Global Optimization | 2018-12-27 | Paper |
Binary quadratic optimization problems that are difficult to solve by conic relaxations
Discrete Optimization | 2018-05-24 | Paper |
Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
SIAM Journal on Optimization | 2017-05-30 | Paper |
Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
ACM Transactions on Mathematical Software | 2017-05-19 | Paper |
A robust Lagrangian-DNN method for a class of quadratic optimization problems
Computational Optimization and Applications | 2017-04-21 | Paper |
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Journal of Global Optimization | 2016-05-25 | Paper |
Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
Journal of Optimization Theory and Applications | 2016-05-17 | Paper |
Exploiting sparsity in SDP relaxation of polynomial optimization problems
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
Mathematical Programming. Series A. Series B | 2016-04-04 | Paper |
Simplified copositive and Lagrangian relaxations for linearly constrained quadratic optimization problems in continuous and binary variables
Pacific Journal of Optimization | 2014-11-07 | Paper |
Faster, but weaker, relaxations for quadratically constrained quadratic programs
Computational Optimization and Applications | 2014-09-18 | Paper |
A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
SIAM Journal on Optimization | 2014-04-09 | Paper |
| A continuation method for large-sized sensor network localization problems | 2013-03-07 | Paper |
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
Mathematical Programming. Series A. Series B | 2011-09-27 | Paper |
Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
SIAM Journal on Optimization | 2010-03-17 | Paper |
Solving polynomial least squares problems via semidefinite programming relaxations
Journal of Global Optimization | 2010-01-25 | Paper |
Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP
Applied Mathematics and Optimization | 2009-06-17 | Paper |
Recognizing underlying sparsity in optimization
Mathematical Programming. Series A. Series B | 2009-04-24 | Paper |
SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS
Journal of the Operations Research Society of Japan | 2009-01-28 | Paper |
PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
Computing | 2007-09-06 | Paper |
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
SIAM Journal on Optimization | 2006-05-30 | Paper |
Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
SIAM Journal on Optimization | 2005-09-16 | Paper |
Sparsity in sums of squares of polynomials
Mathematical Programming. Series A. Series B | 2005-05-12 | Paper |
Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
Optimization Methods & Software | 2005-03-07 | Paper |
Numerical stability of path tracing in polyhedral homotopy continuation methods
Computing | 2005-02-23 | Paper |
PHoM -- a polyhedral homotopy continuation method for polynomial systems
Computing | 2005-02-11 | Paper |
A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES
Journal of the Operations Research Society of Japan | 2004-03-22 | Paper |
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Computational Optimization and Applications | 2003-12-04 | Paper |
Computing all nonsingular solutions of cyclic-n polynomial using polyhedral homotopy continuation methods
Journal of Computational and Applied Mathematics | 2003-05-19 | Paper |
| scientific article; zbMATH DE number 1860730 (Why is no real title available?) | 2003-05-12 | Paper |
| scientific article; zbMATH DE number 1860731 (Why is no real title available?) | 2003-01-28 | Paper |
Solving singular integral equations using Gaussian quadrature and overdetermined system
Computers & Mathematics with Applications | 2002-08-06 | Paper |
A Newton-based approach for attributing tumor lethality in animal carcinogenicity studies.
Computational Statistics and Data Analysis | 2002-03-03 | Paper |
Second order cone programming relaxation of nonconvex quadratic optimization problems
Optimization Methods & Software | 2002-02-07 | Paper |
| scientific article; zbMATH DE number 1382844 (Why is no real title available?) | 2000-06-25 | Paper |
| scientific article; zbMATH DE number 1457560 (Why is no real title available?) | 2000-06-12 | Paper |
| scientific article; zbMATH DE number 1457372 (Why is no real title available?) | 2000-06-12 | Paper |
Numerical solutions of Cauchy singular integral equations using generalized inverses
Computers & Mathematics with Applications | 2000-01-20 | Paper |
| scientific article; zbMATH DE number 991947 (Why is no real title available?) | 1997-05-06 | Paper |
Computational techniques for inverse problems in kidney modeling
Applied Mathematics Letters | 1996-11-12 | Paper |
The convergence of quasi-Gauss-Newton methods for nonlinear problems
Computers & Mathematics with Applications | 1995-07-26 | Paper |
A quasi-Newton method for solving nonlinear algebraic equations
Computers & Mathematics with Applications | 1993-04-01 | Paper |
Using quasi-Newton methods for kidney modeling equations
Applied Mathematics Letters | 1990-01-01 | Paper |
An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
(available as arXiv preprint) | N/A | Paper |
