Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems
From MaRDI portal
Publication:2396463
DOI10.1016/j.amc.2013.11.013zbMath1364.90280OpenAlexW2066145330MaRDI QIDQ2396463
David Yang Gao, Xiaojun Zhou, Chun Hua Yang
Publication date: 8 June 2017
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.11.013
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Multi-scale modelling and canonical dual finite element method in phase transitions of solids
- On global optimizations with polynomials
- A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling
- Manifestations of the Schur complement
- Duality principles in nonconvex systems. Theory, methods and applications
- Algorithm 920
- Geometric nonlinearity: potential energy, complementary energy, and the gap function
- Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Semidefinite Approximations for Global Unconstrained Polynomial Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
