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

DOI10.1016/J.AMC.2013.11.013zbMATH Open1364.90280OpenAlexW2066145330MaRDI QIDQ2396463FDOQ2396463

David Y. Gao, Chunhua Yang, Xiaojun Zhou

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

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

zbMATH Keywords

global optimizationpolynomial optimizationcanonical dual algorithm

Mathematics Subject Classification ID

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

Cites Work

• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• Duality principles in nonconvex systems. Theory, methods and applications
• Title not available (Why is that?)
• Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
• Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
• A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling
• Manifestations of the Schur complement
• Geometric nonlinearity: potential energy, complementary energy, and the gap function
• Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
• Algorithm 920
• Convergent Relaxations of Polynomial Optimization Problems with Noncommuting Variables
• Multi-scale modelling and canonical dual finite element method in phase transitions of solids
• Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
• Second‐Order Cone Programming Relaxation of Sensor Network Localization
• On global optimizations with polynomials
• Semidefinite Approximations for Global Unconstrained Polynomial Optimization

Cited In (1)

• Canonical duality for box constrained nonconvex and nonsmooth optimization problems

Uses Software

• SeDuMi
• SFSDP

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)