Certifying the global optimality of quartic minimization over the sphere
characteristic polynomialcritical pointsdeterminantdualityeigenvectorselimination methodflatnessglobal optimalitymoment matrixnondegeneratenonnegative polynomialpositivstellensatzquartic minimizationSDP relaxationsspheresums of squarestensor
Solving polynomial systems; resultants (13P15) Eigenvalues, singular values, and eigenvectors (15A18) Multilinear algebra, tensor calculus (15A69) Duality theory (optimization) (49N15) Numerical computation of roots of polynomial equations (65H04) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
- A DCA-Newton method for quartic minimization over the sphere
- Finding the global optimum of a class of quartic minimization problem
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- Optimality conditions and optimization methods for quartic polynomial optimization
- Canonical dual approach for minimizing a nonconvex quadratic function over a sphere
- A general formula for the algebraic degree in semidefinite programming
- A generalized flat extension theorem for moment matrices
- A new bound for Pólya's theorem with applications to polynomials positive on polyhedra.
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Algebraic degree of polynomial optimization
- An elementary recursive bound for effective Positivstellensatz and Hilbert's 17th problem
- An exact Jacobian SDP relaxation for polynomial optimization
- An introduction to the computational complexity of matrix multiplication
- Anneaux preordonnes
- Approximation of the stability number of a graph via copositive programming
- Best nonnegative rank-one approximations of tensors
- Cayley-Bacharach theorems and conjectures
- Certifying convergence of Lasserre's hierarchy via flat truncation
- Characterization of the subdifferential of some matrix norms
- Class of global minimum bounds of polynomial functions
- Complementarity and nondegeneracy in semidefinite programming
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Convergence rate analysis for the higher order power method in best rank one approximations of tensors
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Convex Analysis
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Eigenconfigurations of tensors
- Eigenvalues and invariants of tensors
- Eigenvalues of a real supersymmetric tensor
- Eigenvectors of tensors and algorithms for Waring decomposition
- Exploiting Algebraic Structure in Sum of Squares Programs
- Extremal positive semidefinite forms
- Extremal psd forms with few terms
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Flat extensions of positive moment matrices: recursively generated relations
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- Handbook of semidefinite programming. Theory, algorithms, and applications
- How many eigenvalues of a random symmetric tensor are real?
- scientific article; zbMATH DE number 1601019 (Why is no real title available?)
- scientific article; zbMATH DE number 5968745 (Why is no real title available?)
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 3129782 (Why is no real title available?)
- scientific article; zbMATH DE number 4002281 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 4082855 (Why is no real title available?)
- scientific article; zbMATH DE number 3782042 (Why is no real title available?)
- scientific article; zbMATH DE number 40939 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 52737 (Why is no real title available?)
- scientific article; zbMATH DE number 3563286 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 3634395 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 527343 (Why is no real title available?)
- scientific article; zbMATH DE number 575960 (Why is no real title available?)
- scientific article; zbMATH DE number 671755 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 1984325 (Why is no real title available?)
- scientific article; zbMATH DE number 1489808 (Why is no real title available?)
- scientific article; zbMATH DE number 1490041 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 823379 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- scientific article; zbMATH DE number 3219899 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- scientific article; zbMATH DE number 3193809 (Why is no real title available?)
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Minimizing polynomials via sum of squares over the gradient ideal
- Noncommutative convexity arises from linear matrix inequalities
- Nondifferentiable optimization and polynomial problems
- Nonnegative polynomials and sums of squares
- Nonsmooth Equations: Motivation and Algorithms
- On Compact Complex Analytic Varieties
- On determinants and eigenvalue theory of tensors
- On eigenvalues of matrices dependent on a parameter
- On Fully Real Eigenconfigurations of Tensors
- On the complexity of Putinar's Positivstellensatz
- On the complexity of Schmüdgen's Positivstellensatz
- On the Equivalence of Algebraic Approaches to the Minimization of Forms on the Simplex
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Optimization and nonsmooth analysis
- Optimization of Polynomial Functions
- Optimization of Polynomials on Compact Semialgebraic Sets
- ORBITOPES
- Positive polynomials and sums of squares
- Power sums, Gorenstein algebras, and determinantal loci. With an appendix `The Gotzmann theorems and the Hilbert scheme' by Anthony Iarrobino and Steven L. Kleiman
- Representing polynomials by positive linear functions on compact convex polyhedra
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Second-order directional derivatives of all eigenvalues of a symmetric matrix
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite relaxation and nonconvex quadratic optimization
- Semidefinite relaxations for best rank-1 tensor approximations
- Semidefinite representations for finite varieties
- Semismooth Matrix-Valued Functions
- Solution of the truncated complex moment problem for flat data
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- Spectral operators of matrices
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Sum of squares methods for minimizing polynomial forms over spheres and hypersurfaces
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
- Symmetric Tensors and Symmetric Tensor Rank
- Symmetry groups, semidefinite programs, and sums of squares
- Symmetry in semidefinite programs
- Tensor analysis. Spectral theory and special tensors
- The \(\mathcal A\)-truncated \(K\)-moment problem
- The K-moment problem for compact semi-algebraic sets
- The algebraic degree of semidefinite programming
- The average number of critical rank-one approximations to a tensor
- The degree of the E-characteristic polynomial of an even order tensor
- The E-characteristic polynomial of a tensor of dimension 2
- The E-eigenvectors of tensors
- The Euclidean distance degree of an algebraic variety
- The Expected Number of Eigenvalues of a Real Gaussian Tensor
- The number of eigenvalues of a tensor
- The number of singular vector tuples and uniqueness of best rank-one approximation of tensors
- The proof of Tchakaloff’s Theorem
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications
- There are significantly more nonnegative polynomials than sums of squares
- Theta bodies for polynomial ideals
- Toric varieties
- Uniform denominators in Hilbert's seventeenth problem
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Variational Analysis
- Vector bundles on complex projective spaces
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- Finding the global optimum of a class of quartic minimization problem
- Global convergence of SSM for minimizing a quadratic over a sphere
- A DCA-Newton method for quartic minimization over the sphere
- Quadratic Growth and Linear Convergence of a DCA Method for Quartic Minimization over the Sphere
- The R-linear convergence of IPPDA for symmetric low rank orthogonal tensor approximation
- Some properties of bi-form optimization over generalized spheres
This page was built for publication: Certifying the global optimality of quartic minimization over the sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2158108)