| Publication | Date of Publication | Type |
|---|
Solving two-trust-region subproblems using semidefinite optimization with eigenvector branching
Journal of Optimization Theory and Applications | 2024-09-02 | Paper |
Convex hull representations for bounded products of variables
Journal of Global Optimization | 2021-08-17 | Paper |
Quadratic optimization with switching variables: the convex hull for \(n=2\)
Mathematical Programming. Series A. Series B | 2021-08-11 | Paper |
Testing copositivity via mixed-integer linear programming
Linear Algebra and its Applications | 2021-02-12 | Paper |
Efficient solution of maximum-entropy sampling problems
Operations Research | 2021-01-19 | Paper |
Continuous relaxations for Constrained Maximum-Entropy Sampling
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
Maximum-entropy sampling and the Boolean quadric polytope
Journal of Global Optimization | 2018-12-27 | Paper |
Quadratic programs with hollows
Mathematical Programming. Series A. Series B | 2018-08-22 | Paper |
Kronecker product constraints with an application to the two-trust-region subproblem
SIAM Journal on Optimization | 2017-03-10 | Paper |
An approach to the dodecahedral conjecture based on bounds for spherical codes
Discrete Geometry and Optimization | 2013-09-13 | Paper |
Second-order-cone constraints for extended trust-region subproblems
SIAM Journal on Optimization | 2013-06-27 | Paper |
Separating doubly nonnegative and completely positive matrices
Mathematical Programming. Series A. Series B | 2013-03-18 | Paper |
Geometric conditions for Euclidean Steiner trees in \(\mathbb R^d\)
Computational Geometry | 2013-03-12 | Paper |
On convex relaxations for quadratically constrained quadratic programming
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
Interior-point algorithms for a generalization of linear programming and weighted centring
Optimization Methods & Software | 2012-11-06 | Paper |
Computable representations for convex hulls of low-dimensional quadratic forms
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
A note on ``\(5\times 5\) completely positive matrices
Linear Algebra and its Applications | 2010-07-20 | Paper |
The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
Linear Algebra and its Applications | 2009-09-14 | Paper |
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Journal of Global Optimization | 2009-07-13 | Paper |
Two ``well-known properties of subgradient optimization
Mathematical Programming. Series A. Series B | 2009-05-05 | Paper |
An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
Discrete Optimization | 2008-10-29 | Paper |
D.C. versus copositive bounds for standard QP
Journal of Global Optimization | 2006-01-13 | Paper |
| scientific article; zbMATH DE number 2196289 (Why is no real title available?) | 2005-08-22 | Paper |
The thirteen spheres: a new proof
Discrete & Computational Geometry | 2004-12-13 | Paper |
The volumetric barrier for convex quadratic constraints
Mathematical Programming. Series A. Series B | 2004-10-28 | Paper |
Recent advances in the solution of quadratic assignment problems
Mathematical Programming. Series A. Series B | 2003-09-01 | Paper |
Improved Complexity for Maximum Volume Inscribed Ellipsoids
SIAM Journal on Optimization | 2003-01-05 | Paper |
Solving large quadratic assignment problems on computational grids
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
Improved linear programming bounds for antipodal spherical codes.
Discrete & Computational Geometry | 2002-08-20 | Paper |
A new bound for the quadratic assignment problem based on convex quadratic programming
Mathematical Programming. Series A. Series B | 2002-06-05 | Paper |
Solving quadratic assignment problems using convex quadratic programming relaxations
Optimization Methods & Software | 2002-02-26 | Paper |
Ellipsoidal approximations of convex sets based on the volumetric barrier
Mathematics of Operations Research | 2001-11-26 | Paper |
Probabilistic analysis of an infeasible-interior-point algorithm for linear programming
Mathematics of Operations Research | 2001-11-26 | Paper |
The volumetric barrier for semidefinite programming.
Mathematics of Operations Research | 2001-11-26 | Paper |
| Average performance of a self-dual interior point algorithm for linear programming | 2001-09-18 | Paper |
Maximum-entropy remote sampling
Discrete Applied Mathematics | 2001-06-19 | Paper |
A note on the augmented Hessian when the reduced Hessian is semidefinite
SIAM Journal on Optimization | 2001-03-19 | Paper |
On Lagrangian relaxation of quadratic matrix constraints
SIAM Journal on Matrix Analysis and Applications | 2001-03-19 | Paper |
Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem
SIAM Journal on Optimization | 2001-03-19 | Paper |
Using continuous nonlinear relaxations to solve constrained maximum-entropy sampling problems
Mathematical Programming. Series A. Series B | 2001-02-09 | Paper |
Strong duality for a trust-region type relaxation of the quadratic assignment problem
Linear Algebra and its Applications | 2000-06-19 | Paper |
Linear Programming in O([n3/ln nL) Operations]
SIAM Journal on Optimization | 1999-11-24 | Paper |
Towards a Practical Volumetric Cutting Plane Method for Convex Programming
SIAM Journal on Optimization | 1999-02-22 | Paper |
| scientific article; zbMATH DE number 1182576 (Why is no real title available?) | 1998-08-02 | Paper |
Volumetric path following algorithms for linear programming
Mathematical Programming. Series A. Series B | 1998-02-19 | Paper |
| scientific article; zbMATH DE number 1047677 (Why is no real title available?) | 1997-08-11 | Paper |
On Vaidya's Volumetric Cutting Plane Method for Convex Programming
Mathematics of Operations Research | 1997-06-09 | Paper |
Large step volumetric potential reduction algorithms for linear programming
Annals of Operations Research | 1996-07-01 | Paper |
On Long Step Path Following and SUMT for Linear and Quadratic Programming
SIAM Journal on Optimization | 1996-05-13 | Paper |
A New Infinity-Norm Path Following Algorithm for Linear Programming
SIAM Journal on Optimization | 1995-08-07 | Paper |
A Monotonic Build-Up Simplex Algorithm for Linear Programming
Operations Research | 1994-09-15 | Paper |
On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
Mathematical Programming. Series A. Series B | 1994-04-12 | Paper |
Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming
Mathematical Programming. Series A. Series B | 1994-04-12 | Paper |
A Family of Search Directions for Karmarkar's Algorithm
Operations Research | 1994-01-02 | Paper |
A long-step barrier method for convex quadratic programming
Algorithmica | 1993-12-06 | Paper |
On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
Algorithmica | 1993-04-01 | Paper |
Crashing a maximum-weight complementary basis
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
Long steps in an \(O(n^ 3L)\) algorithm for linear programming
Mathematical Programming. Series A. Series B | 1993-01-16 | Paper |
On the Performance of Karmarkar’s Algorithm over a Sequence of Iterations
SIAM Journal on Optimization | 1993-01-16 | Paper |
On interior algorithms for linear programming with no regularity assumptions
Operations Research Letters | 1993-01-16 | Paper |
A combined phase I-phase II scaled potential algorithm for linear programming
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
On monotonicity in the scaled potential algorithm for linear programming
Linear Algebra and its Applications | 1991-01-01 | Paper |
A standard form variant, and safeguarded linesearch, for the modified Karmarkar algorithm
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4202018 (Why is no real title available?) | 1990-01-01 | Paper |
A combined phase I-phase II projective algorithm for linear programming
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
The Worst-Case Step in Karmarkar's Algorithm
Mathematics of Operations Research | 1989-01-01 | Paper |
Linear programming and the Newton barrier flow
Mathematical Programming. Series A. Series B | 1988-01-01 | Paper |
Using Gauss-Jordan elimination to compute the index, generalized nullspaces, and Drazin inverse
Linear Algebra and its Applications | 1987-01-01 | Paper |
A monotonic projective algorithm for fractional linear programming
Algorithmica | 1986-01-01 | Paper |
A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm
Operations Research Letters | 1986-01-01 | Paper |
