Global optimality conditions and optimization methods for constrained polynomial programming problems
DOI10.1016/J.AMC.2015.04.040zbMATH Open1410.90206OpenAlexW248636453MaRDI QIDQ1663418FDOQ1663418
Julien Ugon, L. Zhang, Jing Tian, Zhiyou 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
Recommendations
- Global optimality conditions and optimization methods for polynomial programming problems
- Global optimization with polynomials and the problem of moments
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Optimization methods for a class of integer polynomial programming problems
- Global optimality conditions for a class of polynomial integer programming problems with linear constraints
linear transformationglobal optimization methodlocal optimization methodnecessary global optimality conditionconstrained polynomial programming problem
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Approximation algorithms (68W25)
Cites Work
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Global optimization with polynomials and the problem of moments
- GloptiPoly
- A collection of test problems for constrained global optimization algorithms
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- GloptiPoly 3: moments, optimization and semidefinite programming
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints
- Nonlinear Programming
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Experimental testing of advanced scatter search designs for global optimization of multimodal functions
- A Semidefinite Relaxation Scheme for Multivariate Quartic Polynomial Optimization with Quadratic Constraints
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Semidefinite relaxation approximation for multivariate bi‐quadratic optimization with quadratic constraints
- A novel filled function method and quasi-filled function method for global optimization
- Unconstrained and constrained global optimization of polynomial functions in one variable
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Transposition Theorems and Qualification‐Free Optimality Conditions
Cited In (6)
- Some applications of a polynomial inequality to global optimization
- Global optimization of nonconvex polynomial programming problems having rational exponents
- An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Theoretical filtering of RLT bound-factor constraints for solving polynomial programming problems to global optimality
- Unconstrained and constrained global optimization of polynomial functions in one variable
Uses Software
This page was built for publication: Global optimality conditions and optimization methods for constrained polynomial programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1663418)
