| Publication | Date of Publication | Type |
|---|
| Further development in convex conic reformulation of geometric nonconvex conic optimization problems | 2024-10-22 | Paper |
| Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems | 2023-08-10 | 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 | 2022-06-14 | 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 | 2021-07-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4963668 | 2021-02-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5148358 | 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 | 2020-05-26 | Paper |
| A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems | 2020-05-20 | Paper |
| Algorithm 996 | 2020-04-24 | Paper |
| Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems | 2018-12-27 | Paper |
| Binary quadratic optimization problems that are difficult to solve by conic relaxations | 2018-05-24 | Paper |
| Algorithm 920 | 2017-05-19 | Paper |
| A robust Lagrangian-DNN method for a class of quadratic optimization problems | 2017-04-21 | Paper |
| Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization | 2016-05-17 | Paper |
| Exploiting Sparsity in SDP Relaxation of Polynomial Optimization Problems | 2016-04-26 | Paper |
| A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems | 2016-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2928409 | 2014-11-07 | Paper |
| Faster, but weaker, relaxations for quadratically constrained quadratic programs | 2014-09-18 | Paper |
| A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming | 2014-04-09 | Paper |
| Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization | 2013-05-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4908853 | 2013-03-07 | Paper |
| Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion | 2011-09-27 | Paper |
| A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming | 2011-02-08 | Paper |
| Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems | 2010-09-14 | Paper |
| SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS | 2010-05-19 | Paper |
| Exploiting Sparsity in SDP Relaxation for Sensor Network Localization | 2010-03-17 | Paper |
| Solving polynomial least squares problems via semidefinite programming relaxations | 2010-01-25 | Paper |
| Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP | 2009-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3632452 | 2009-06-11 | Paper |
| Recognizing underlying sparsity in optimization | 2009-04-24 | Paper |
| A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones | 2009-02-13 | Paper |
| SPARSE SECOND ORDER CONE PROGRAMMING FORMULATIONS FOR CONVEX OPTIMIZATION PROBLEMS | 2009-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3517222 | 2008-08-12 | Paper |
| EFFICIENT EVALUATION OF POLYNOMIALS AND THEIR PARTIAL DERIVATIVES IN HOMOTOPY CONTINUATION METHODS | 2008-07-11 | Paper |
| EQUALITY BASED CONTRACTION OF SEMIDEFINITE PROGRAMMING RELAXATIONS IN POLYNOMIAL OPTIMIZATION | 2008-07-11 | Paper |
| PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems | 2007-09-06 | Paper |
| A conversion of an SDP having free variables into the standard form SDP | 2007-08-27 | Paper |
| An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones | 2007-05-10 | Paper |
| Dynamic enumeration of all mixed cells | 2007-04-26 | Paper |
| Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity | 2006-05-30 | Paper |
| Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems | 2005-09-16 | Paper |
| Sparsity in sums of squares of polynomials | 2005-05-12 | Paper |
| SOLVING LARGE SCALE OPTIMIZATION PROBLEMS VIA GRID AND CLUSTER COMPUTING(<Special Issue>Network Design, Control and Optimization) | 2005-04-23 | Paper |
| Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) | 2005-04-05 | Paper |
| Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint | 2005-03-07 | Paper |
| Numerical stability of path tracing in polyhedral homotopy continuation methods | 2005-02-23 | Paper |
| PHoM -- a polyhedral homotopy continuation method for polynomial systems | 2005-02-11 | Paper |
| A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES | 2004-03-22 | Paper |
| Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions | 2003-12-04 | Paper |
| Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results | 2003-10-29 | Paper |
| ENUMERATION OF ALL SOLUTIONS OF A COMBINATORIAL LINEAR INEQUALITY SYSTEM ARISING FROM THE POLYHEDRAL HOMOTOPY CONTINUATION METHOD | 2003-08-25 | Paper |
| Parallel implementation of successive convex relaxation methods for quadratic optimization problems | 2003-06-18 | Paper |
| Some fundamental properties of successive convex relaxation methods on LCP and related problems | 2003-06-09 | Paper |
| Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods | 2003-05-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790460 | 2003-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4790461 | 2003-01-28 | Paper |
| Lagrangian Dual Interior-Point Methods for Semidefinite Programs | 2003-01-05 | Paper |
| On the finite convergence of successive SDP relaxation methods | 2002-11-20 | Paper |
| Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming | 2002-05-21 | Paper |
| Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method | 2002-04-23 | Paper |
| Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem | 2002-02-10 | Paper |
| Second order cone programming relaxation of nonconvex quadratic optimization problems | 2002-02-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2760111 | 2001-12-18 | Paper |
| Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets | 2001-11-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2742678 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2742680 | 2001-09-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2742681 | 2001-09-23 | Paper |
| Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. | 2001-07-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527205 | 2001-04-26 | Paper |
| Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework | 2001-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761952 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761954 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761961 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4761967 | 2001-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4496019 | 2000-10-23 | Paper |
| Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets | 2000-10-19 | Paper |
| A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming | 2000-09-14 | Paper |
| Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems | 2000-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705457 | 1999-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4703904 | 1999-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4704007 | 1999-12-01 | Paper |
| A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh--Haeberly--Overton Search Direction | 1999-11-24 | Paper |
| Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation | 1999-09-23 | Paper |
| A conjugate direction method for approximating the analytic center of a polytope | 1998-10-15 | Paper |
| Centers of Monotone Generalized Complementarity Problems | 1998-08-03 | Paper |
| Exploiting sparsity in primal-dual interior-point methods for semidefinite programming | 1998-06-02 | Paper |
| Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP | 1998-05-12 | Paper |
| Reduction of monotone linear complementarity problems over cones to linear programs over cones | 1998-04-13 | Paper |
| Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs | 1998-03-11 | Paper |
| Semidefinite programming relaxation for nonconvex quadratic programs | 1997-07-23 | Paper |
| Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices | 1997-03-11 | Paper |
| Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs | 1996-11-06 | Paper |
| A Generalized Convexity and Variational Inequality for Quasi-Convex Minimization | 1996-07-16 | Paper |
| Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming | 1995-05-30 | Paper |
| Global convergence in infeasible-interior-point algorithms | 1994-09-26 | Paper |
| A little theorem of the big \({\mathcal M}\) in interior point algorithms | 1994-08-16 | Paper |
| On the big \({\mathcal M}\) in the affine scaling algorithm | 1994-04-28 | Paper |
| A General Framework of Continuation Methods for Complementarity Problems | 1994-04-12 | Paper |
| A primal-dual infeasible-interior-point algorithm for linear programming | 1994-03-10 | Paper |
| Theoretical convergence of large-step primal-dual interior point algorithms for linear programming | 1993-08-30 | Paper |
| Large-Step Interior Point Algorithms for Linear Complementarity Problems | 1993-08-11 | Paper |
| A unified approach to interior point algorithms for linear complementary problems | 1993-01-23 | Paper |
| An interior point potential reduction algorithm for the linear complementarity problem | 1993-01-16 | Paper |
| Homotopy Continuation Methods for Nonlinear Complementarity Problems | 1992-06-28 | Paper |
| A unified approach to interior point algorithms for linear complementarity problems: A summary | 1992-06-27 | Paper |
| An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems | 1992-06-25 | Paper |
| The relation between the path of centers and Smale's regularization of the linear programming problem | 1991-01-01 | Paper |
| Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems | 1990-01-01 | Paper |
| Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem | 1990-01-01 | Paper |
| A new continuation method for complementarity problems with uniform P- functions | 1989-01-01 | Paper |
| A polynomial-time algorithm for a class of linear complementarity problems | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3491304 | 1989-01-01 | Paper |
| A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD | 1988-01-01 | Paper |
| Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming | 1987-01-01 | Paper |
| Determining basic variables of optimal solutions in Karmarkar's new LP algorithm | 1986-01-01 | Paper |
| EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS | 1986-01-01 | Paper |
| IMPROVING THE COMPUTATIONAL EFFICIENCY OF FIXED POINT ALGORITHMS | 1984-01-01 | Paper |
| A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm | 1984-01-01 | Paper |
| Continuous deformation of nonlinear programs | 1984-01-01 | Paper |
| Computation of all solutions to a system of polynomial equations | 1983-01-01 | Paper |
| Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods | 1982-01-01 | Paper |
| On the number of solutions to a class of complementarity problems | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3925083 | 1981-01-01 | Paper |
| A property of matrices with positive determinants | 1980-01-01 | Paper |
| On the Relationship Between Conditions that Insure a PL Mapping is a Homeomorphism | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3896414 | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3936512 | 1980-01-01 | Paper |
| On the number of solutions to a class of linear complementarity problems | 1979-01-01 | Paper |
| A Complementary Pivoting Approach to Parametric Nonlinear Programming | 1979-01-01 | Paper |
| A PL homotopy for finding all the roots of a polynomial | 1979-01-01 | Paper |
| A modification of todd's triangulationJ 3 | 1978-01-01 | Paper |
| Studies on Piecewise-Linear Approximations of Piecewise-C1 Mappings in Fixed Points and Complementarity Theory | 1978-01-01 | Paper |
| On the homotopic approach to systems of equations with separable mappings | 1978-01-01 | Paper |
| On the existence and uniqueness of solutions in nonlinear complementarity theory | 1977-01-01 | Paper |
| An Extension of Lemke’s Method to the Piecewise Linear Complementarity Problem | 1976-01-01 | Paper |
| A unification of the existence theorems of the nonlinear complementarity problem | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4193281 | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5663668 | 1972-01-01 | Paper |
| Some fundamental properties of successive convex relaxation methods on LCP and related problems | N/A | Paper |
| An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c | N/A | Paper |
