Result 1 to 20 of 499 total
Solving $k$-cluster problems to optimality with semidefinite programming. (English)
Math. Program. 136, No. 2 (B), 279-300 (2012).
1
The quadratic Graver cone, quadratic integer minimization, and extensions. (English)
Math. Program. 136, No. 2 (B), 301-323 (2012).
2
Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces. (English)
Front. Math. China 7, No. 2, 321-346 (2012).
3
A robust algorithm for semidefinite programming. (English)
Optim. Methods Softw. 27, No. 4-5, 667-693 (2012).
4
Approximation guarantees for the minimum linear arrangement problem by higher eigenvalues. (English)
Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15‒17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 313-324 (2012).
5
On linear and semidefinite programming relaxations for hypergraph matching. (English)
Math. Program. 135, No. 1-2 (A), 123-148 (2012).
6
Enhancing RLT-based relaxations for polynomial programming problems via a new class of $v$-semidefinite cuts. (English)
Comput. Optim. Appl. 52, No. 2, 483-506 (2012).
7
SDP gaps from pairwise independence. (English)
Theory Comput. 8, Paper No. 12, 269-289, electronic only (2012).
8
Regularization methods for SDP relaxations in large-scale polynomial optimization. (English)
SIAM J. Optim. 22, No. 2, 408-428 (2012).
9
Improving quantum clocks via semidefinite programming. (English)
Quantum Inf. Comput. 12, No. 7-8, 553-574 (2012).
10
A filter successive linear programming method for nonlinear semidefinite programming problems. (English)
Numer. Algebra Control Optim. 2, No. 1, 193-206 (2012).
11
Wireless capacity with arbitrary gain matrix. (English)
Erlebach, Thomas (ed.) et al., Algorithms for sensor systems. 7th international symposium on algorithms for sensor systems, wireless ad hoc networks and autonomous mobile entities, ALGOSENSORS 2011, Saarbrücken, Germany, September 8‒9, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-28208-9/pbk). Lecture Notes in Computer Science 7111, 215-224 (2012).
12
Matrix relaxations in combinatorial optimization. (English)
Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17‒21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 483-511 (2012).
13
Computation with polynomial equations and inequalities arising in combinatorial optimization. (English)
Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17‒21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 447-481 (2012).
14
Linear programming relaxations of quadratically constrained quadratic programs. (English)
Lee, Jon (ed.) et al., Mixed integer nonlinear programming. Selected papers based on the presentations at the IMA workshop mixed-integer nonlinear optimization: Algorithmic advances and applications, Minneapolis, MN, USA, November 17‒21, 2008. New York, NY: Springer (ISBN 978-1-4614-1926-6/hbk; 978-1-4614-1927-3/ebook). The IMA Volumes in Mathematics and its Applications 154, 407-426 (2012).
15
An improved algorithm to test copositivity. (English)
J. Glob. Optim. 52, No. 3, 537-551 (2012).
16
Exponential lower bounds and integrality gaps for tree-like Lovász-Schrijver procedures. (English)
SIAM J. Comput. 41, No. 1, 128-159 (2012).
17
Strategy for quickest second meeting of two agents in two locations. (English)
Math. Oper. Res. 37, No. 1, 123-128 (2012).
18
Optimal symmetric rendezvous search on three locations. (English)
Math. Oper. Res. 37, No. 1, 111-122 (2012).
19
An approximation theory of matrix rank minimization and its application to quadratic equations. (English)
Linear Algebra Appl. 437, No. 1, 77-93 (2012).
20
Result 1 to 20 of 499 total
Start
Contact
Print
General Help
