Found: 29
Select item for more details and to access through your institution.
Nash Equilibrium Problems of Polynomials.
- Published in:
- Mathematics of Operations Research, 2024, v. 49, n. 2, p. 1065, doi. 10.1287/moor.2022.0334
- By:
- Publication type:
- Article
Homogenization for polynomial optimization with unbounded sets.
- Published in:
- Mathematical Programming, 2023, v. 200, n. 1, p. 105, doi. 10.1007/s10107-022-01878-5
- By:
- Publication type:
- Article
DEHOMOGENIZATION FOR COMPLETELY POSITIVE TENSORS.
- Published in:
- Numerical Algebra, Control & Optimization, 2023, v. 13, n. 2, p. 340, doi. 10.3934/naco.2022037
- By:
- Publication type:
- Article
Convex generalized Nash equilibrium problems and polynomial optimization.
- Published in:
- Mathematical Programming, 2023, v. 198, n. 2, p. 1485, doi. 10.1007/s10107-021-01739-7
- By:
- Publication type:
- Article
Loss functions for finite sets.
- Published in:
- Computational Optimization & Applications, 2023, v. 84, n. 2, p. 421, doi. 10.1007/s10589-022-00420-9
- By:
- Publication type:
- Article
The Saddle Point Problem of Polynomials.
- Published in:
- Foundations of Computational Mathematics, 2022, v. 22, n. 4, p. 1133, doi. 10.1007/s10208-021-09526-8
- By:
- Publication type:
- Article
Special Issue: Polynomial and Tensor Optimization.
- Published in:
- 2022
- By:
- Publication type:
- Editorial
The Gauss–Seidel method for generalized Nash equilibrium problems of polynomials.
- Published in:
- Computational Optimization & Applications, 2021, v. 78, n. 2, p. 529, doi. 10.1007/s10589-020-00242-7
- By:
- Publication type:
- Article
Preface to the special issue on optimization with polynomials and tensors.
- Published in:
- 2020
- By:
- Publication type:
- Editorial
Tight relaxations for polynomial optimization and Lagrange multiplier expressions.
- Published in:
- Mathematical Programming, 2019, v. 178, n. 1/2, p. 1, doi. 10.1007/s10107-018-1276-2
- By:
- Publication type:
- Article
Completely Positive Binary Tensors.
- Published in:
- Mathematics of Operations Research, 2019, v. 44, n. 3, p. 1087, doi. 10.1287/moor.2018.0963
- By:
- Publication type:
- Article
Tensor eigenvalue complementarity problems.
- Published in:
- Mathematical Programming, 2018, v. 170, n. 2, p. 507, doi. 10.1007/s10107-017-1167-y
- By:
- Publication type:
- Article
Real eigenvalues of nonsymmetric tensors.
- Published in:
- Computational Optimization & Applications, 2018, v. 70, n. 1, p. 1, doi. 10.1007/s10589-017-9973-y
- By:
- Publication type:
- Article
Generating Polynomials and Symmetric Tensor Decompositions.
- Published in:
- Foundations of Computational Mathematics, 2017, v. 17, n. 2, p. 423, doi. 10.1007/s10208-015-9291-7
- By:
- Publication type:
- Article
Linear optimization with cones of moments and nonnegative polynomials.
- Published in:
- Mathematical Programming, 2015, v. 153, n. 1, p. 247, doi. 10.1007/s10107-014-0797-6
- By:
- Publication type:
- Article
The hierarchy of local minimums in polynomial optimization.
- Published in:
- Mathematical Programming, 2015, v. 151, n. 2, p. 555, doi. 10.1007/s10107-014-0845-2
- By:
- Publication type:
- Article
The $${\mathcal {A}}$$ -Truncated $$K$$ -Moment Problem.
- Published in:
- Foundations of Computational Mathematics, 2014, v. 14, n. 6, p. 1243, doi. 10.1007/s10208-014-9225-9
- By:
- Publication type:
- Article
Optimality conditions and finite convergence of Lasserre's hierarchy.
- Published in:
- Mathematical Programming, 2014, v. 146, n. 1/2, p. 97, doi. 10.1007/s10107-013-0680-x
- By:
- Publication type:
- Article
Certifying convergence of Lasserre’s hierarchy via flat truncation.
- Published in:
- Mathematical Programming, 2013, v. 142, n. 1/2, p. 485, doi. 10.1007/s10107-012-0589-9
- By:
- Publication type:
- Article
An exact Jacobian SDP relaxation for polynomial optimization.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 225, doi. 10.1007/s10107-011-0489-4
- By:
- Publication type:
- Article
A Semidefinite Approach for Truncated K-Moment Problems.
- Published in:
- Foundations of Computational Mathematics, 2012, v. 12, n. 6, p. 851, doi. 10.1007/s10208-012-9132-x
- By:
- Publication type:
- Article
Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces.
- Published in:
- Frontiers of Mathematics in China, 2012, v. 7, n. 2, p. 321, doi. 10.1007/s11464-012-0187-4
- By:
- Publication type:
- Article
First order conditions for semidefinite representations of convex sets defined by rational or singular polynomials.
- Published in:
- Mathematical Programming, 2012, v. 131, n. 1/2, p. 1, doi. 10.1007/s10107-009-0339-9
- By:
- Publication type:
- Article
Polynomial Matrix Inequality and Semidefinite Representation.
- Published in:
- Mathematics of Operations Research, 2011, v. 36, n. 3, p. 398, doi. 10.1287/moor.1110.0498
- By:
- Publication type:
- Article
The algebraic degree of semidefinite programming.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 2, p. 379, doi. 10.1007/s10107-008-0253-6
- By:
- Publication type:
- Article
Semidefinite representation of convex sets.
- Published in:
- Mathematical Programming, 2010, v. 122, n. 1, p. 21, doi. 10.1007/s10107-008-0240-y
- By:
- Publication type:
- Article
Sum of squares method for sensor network localization.
- Published in:
- Computational Optimization & Applications, 2009, v. 43, n. 2, p. 151, doi. 10.1007/s10589-007-9131-z
- By:
- Publication type:
- Article
Global minimization of rational functions and the nearest GCDs.
- Published in:
- Journal of Global Optimization, 2008, v. 40, n. 4, p. 697, doi. 10.1007/s10898-006-9119-8
- By:
- Publication type:
- Article
Minimizing Polynomials via Sum of Squares over the Gradient Ideal.
- Published in:
- Mathematical Programming, 2006, v. 106, n. 3, p. 587, doi. 10.1007/s10107-005-0672-6
- By:
- Publication type:
- Article