Research Output 1988 2019

Filter
Working paper
2019

Generalizations of Schoenberg's Theorem on Positive Definite Kernels

Kuryatnikova, O. & Vera, J. C., Apr 2019, Ithaca: Cornell University Library, 14 p. (arXiv; vol. 1904.02538).

Research output: Working paperOther research output

Open Access
2018

Positive semidefinite approximations to the cone of copositive kernels

Kuryatnikova, O. & Vera, J. C., Dec 2018, Ithaca: Cornell University Library, 29 p. (arXiv; vol. 1812.00274).

Research output: Working paperOther research output

Open Access
Positive semidefinite
Positive Definite Kernels
Cone
kernel
Approximation
2017

Asymmetric information in a capital

Kort, P., Feichtinger, G., Hartl, R. F., Seidl, A. & Wrzaczek, S., 2017, (In preparation).

Research output: Working paperOther research output

Bounds on Entanglement Dimensions and Quantum Graph Parameters via Noncommutative Polynomial Optimization

Gribling, S., de Laat, D. & Laurent, M., 31 Aug 2017, Ithaca: Cornell University Library, 29 p. (arXiv; vol. 1708.09696).

Research output: Working paperOther research output

Quantum Graphs
Entanglement
Stability number
Polynomial
Optimization
14 Downloads (Pure)

Comparison of Lasserre's Measure-based Bounds for Polynomial Optimization to Bounds Obtained by Simulated Annealing

de Klerk, E. & Laurent, M., Mar 2017, Ithaca: Cornell University Library, 12 p. (arXiv; vol. 1703.00744).

Research output: Working paperOther research output

Open Access
File
Simulated Annealing
Polynomial
Optimization
Convex Body
Compact Set

Dynamic Investment Strategies and Leadership in Product Innovation

Dawid, H., Keoula, M. Y., Kopel, M. & Kort, P., 2017, (In preparation) Bielefeld: SSRN, 30 p. (Bielefeld Working Papers in Economics and Management; vol. 03-2017).

Research output: Working paperOther research output

Investment strategy
Product innovation
Production capacity
Market model
Dynamic markets
13 Downloads (Pure)

Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization

Gribling, S., Laat, D. D. & Laurent, M., 4 Aug 2017, Ithaca: Cornell University Library, 45 p. (arXiv; vol. 1708.01573) (Foundations of Computational Mathematics).

Research output: Working paperOther research output

File
Matrix Factorization
Lower bound
Polynomial
Optimization
Positive semidefinite

On the Linear Extension Complexity of Stable Set Polytopes for Perfect Graphs

Hu, H. & Laurent, M., 20 Jun 2017, Ithaca: Cornell University Library, 17 p. (arXiv; vol. 1706.05496).

Research output: Working paperOther research output

Linear Extension
Perfect Graphs
Stable Set
Polytopes
Stable Set Polytope

Perfect Elimination Orderings for Symmetric Matrices

Laurent, M. & Tanigawa, S., 17 Apr 2017, Ithaca: Cornell University Library, 17 p. (arXiv; vol. 1706.05115).

Research output: Working paperOther research output

Open Access
Symmetric matrix
Elimination
Structured Matrices
Chordal Graphs
Weighted Graph
2016

Improved Convergence Rates for Lasserre-type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization

de Klerk, E., Laurent, M. & Hess, R., 16 Mar 2016, Ithaca: Cornell University Library, 21 p. (arXiv; vol. 1603.03329).

Research output: Working paperOther research output

Open Access

Matrices With High Completely Positive Semidefinite Rank

de Laat, D., Gribling, S. & Laurent, M., 3 May 2016, Ithaca: Cornell University Library, 17 p. (arXiv; vol. 1605.00988).

Research output: Working paperOther research output

Open Access
Positive semidefinite
Completely Positive Matrices
Upper bound
Quantum Information Theory
Positive Semidefinite Matrix

On the Worst-Case Complexity of the Gradient Method with Exact Line Search for Smooth Strongly Convex Functions

de Klerk, E., Glineur, F. & Taylor, A., 30 Jun 2016, Itacha: Cornell University Library, 10 p. (arXiv; vol. arXiv:1606.09365).

Research output: Working paperOther research output

Line Search
Gradient Method
Convex function
Gradient Descent Method
Gradient
17 Downloads (Pure)

Similarity-First Search: A New Algorithm With Application to Robinsonian Matrix Recognition

Laurent, M. & Seminaroti, M., Jan 2016, Ithaca: Cornell University Library, 35 p. (arXiv; vol. 1601.03521).

Research output: Working paperOther research output

File
2015

Bound-Constrained Polynomial Optimization Using Only Elementary Calculations

de Klerk, E., Lasserre, J. B., Laurent, M. & Sun, Z., 15 Jul 2015, Ithaca: Cornell University Library, 23 p. (arXiv; vol. 1507.04404).

Research output: Working paperOther research output

Open Access
Hypercube
Polynomial
Optimization
Rate of Convergence
Upper bound
117 Downloads (Pure)

Multi-Period Risk Sharing under Financial Fairness

Bao, H., Ponds, E. & Schumacher, H., 2015, (Submitted) Tilburg, 40 p.

Research output: Working paperOther research output

File
Pareto
Fairness
Sharing rule
Risk sharing
Expected utility

On the Turing Model Complexity of Interior Point Methods for Semidefinite Programming.

de Klerk, E. & Vallentin, F., Jul 2015, Ithaca: Cornell University Library, 16 p. (arXiv; vol. 1507.03549).

Research output: Working paperOther research output

Ellipsoid Method
Diophantine Approximation
Model Complexity
Interior Point Method
Semidefinite Programming