Global optimality conditions and optimization methods for constrained polynomial programming problems
From MaRDI portal
Publication:1663418
DOI10.1016/j.amc.2015.04.040zbMath1410.90206OpenAlexW248636453MaRDI QIDQ1663418
Julien Ugon, Liang Zhang, Jing Tian, Zhi-You Wu
Publication date: 21 August 2018
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/92549
linear transformationglobal optimization methodlocal optimization methodnecessary global optimality conditionconstrained polynomial programming problem
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Approximation algorithms (68W25)
Uses Software
Cites Work
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- A novel filled function method and quasi-filled function method for global optimization
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Unconstrained and constrained global optimization of polynomial functions in one variable
- A collection of test problems for constrained global optimization algorithms
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- Global Optimization with Polynomials and the Problem of Moments
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- GloptiPoly 3: moments, optimization and semidefinite programming
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Transposition Theorems and Qualification‐Free Optimality Conditions
- GloptiPoly
- Nonlinear Programming
