Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems

DOI10.1016/J.AMC.2013.11.013MaRDI QIDQ2396463zbMATH OpenOpenAlexFDO

Authors Xiaojun Zhou, David Y. Gao, Chunhua 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

zbMATH Keywords

global optimizationpolynomial optimizationcanonical dual algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26)

Recommendations

• Canonical primal-dual method for solving nonconvex minimization problems
• Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions
• Application of canonical duality theory to global optimization with polynomials
• On the triality theory for a quartic polynomial optimization problem
• Global optimal solutions to a class of quadrinomial minimization problems with one quadratic constraint

Cites work

• scientific article; zbMATH DE number 3504682 (Why is no real title available?)
• A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling
• Algorithm 920: SFSDP: a sparse version of full semidefinite programming relaxation for sensor network localization problems
• Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• Convergent relaxations of polynomial optimization problems with noncommuting variables
• Duality principles in nonconvex systems. Theory, methods and applications
• Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
• Geometric nonlinearity: potential energy, complementary energy, and the gap function
• Manifestations of the Schur complement
• Multi-scale modelling and canonical dual finite element method in phase transitions of solids
• On global optimizations with polynomials
• 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
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(3)

• Solutions to 8th order polynomial minimization problem
• Canonical primal-dual method for solving nonconvex minimization problems
• Canonical duality for box constrained nonconvex and nonsmooth optimization problems

Describes a project that uses

Uses Software

• SFSDP
• SeDuMi

This page was built for publication: Canonical primal-dual algorithm for solving fourth-order polynomial minimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2396463)