Finding the global optimum of a class of quartic minimization problem
From MaRDI portal
Publication:2114839
DOI10.1007/S10589-021-00345-9zbMATH Open1487.90533arXiv2007.09630OpenAlexW4226412819MaRDI QIDQ2114839FDOQ2114839
Qingzhi Yang, Yuning Yang, Pengfei Huang
Publication date: 15 March 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Abstract: We consider a special nonconvex quartic minimization problem over a single spherical constraint, which includes the discretized energy functional minimization problem of non-rotating Bose-Einstein condensates (BECs) as one of the important applications. Such a problem is studied by exploiting its characterization as a nonlinear eigenvalue problem with eigenvector nonlinearity (NEPv), which admits a unique nonnegative eigenvector, and this eigenvector is exactly the global minimizer to the quartic minimization. With these properties, any algorithm converging to the nonnegative stationary point of this optimization problem finds its global minimum, such as the regularized Newton (RN) method. In particular, we obtain the global convergence to global optimum of the inexact alternating direction method of multipliers (ADMM) for this problem. Numerical experiments for applications in non-rotating BEC validate our theories.
Full work available at URL: https://arxiv.org/abs/2007.09630
Recommendations
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- A DCA-Newton method for quartic minimization over the sphere
- Certifying the global optimality of quartic minimization over the sphere
- On local non-global minimizers of quadratic optimization problem with a single quadratic constraint
- Global optimal solutions to a class of quadrinomial minimization problems with one quadratic constraint
alternating direction method of multipliersspherical constraintBose-Einstein condensationglobal minimizernonlinear eigenvalue
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Numerical methods for eigenvalue problems for boundary value problems involving PDEs (65N25) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17)
Cites Work
- A feasible method for optimization with orthogonality constraints
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Title not available (Why is that?)
- Mathematical theory and numerical methods for Bose-Einstein condensation
- Global optimization with polynomials and the problem of moments
- Computing the Ground State Solution of Bose--Einstein Condensates by a Normalized Gradient Flow
- Matrix Iterative Analysis
- Perron-Frobenius theorem for nonnegative tensors
- On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
- Optimal error estimates of finite difference methods for the Gross-Pitaevskii equation with angular momentum rotation
- A splitting method for orthogonality constrained problems
- Convergence Study on the Symmetric Version of ADMM with Larger Step Sizes
- Global monotone convergence of Newton iteration for a nonlinear eigen-problem
- A generalization of the Perron-Frobenius theorem for nonlinear perturbations of Stieltjes matrices
- Efficient and spectrally accurate numerical methods for computing ground and first excited states in Bose-Einstein condensates
- Ground-state solution of Bose--Einstein condensate by directly minimizing the energy functional
- A regularized Newton method for computing ground states of Bose-Einstein condensates
- A note on semidefinite programming relaxations for polynomial optimization over a single sphere
- A full multigrid method for nonlinear eigenvalue problems
- Numerical analysis of nonlinear eigenvalue problems
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Projecting onto the Intersection of a Cone and a Sphere
- Title not available (Why is that?)
- Non-convex Optimization for Machine Learning
- Adaptive regularized self-consistent field iteration with exact Hessian for electronic structure calculation
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
- A geometric analysis of phase retrieval
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- On solving biquadratic optimization via semidefinite relaxation
- Robust Rayleigh Quotient Minimization and Nonlinear Eigenvalue Problems
Cited In (4)
- Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration
- Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
- Noda iteration for computing generalized tensor eigenpairs
- Newton-based alternating methods for the ground state of a class of multicomponent Bose-Einstein condensates
Uses Software
This page was built for publication: Finding the global optimum of a class of quartic minimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114839)
