Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials

DOI10.1007/s40305-017-0157-3zbMath1390.90452OpenAlexW2597862030MaRDI QIDQ1706680

Jing Tian, Fu-Sheng Bai, Zhi-You Wu

Publication date: 28 March 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-017-0157-3

zbMATH Keywords

linear transformationoptimality conditionsnonlinear programmingLagrange interpolating polynomialsglobal optimization method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Uses Software

• Eigensolve

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
• A new local and global optimization method for mixed integer quadratic programming problems
• Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
• Optimality conditions in nonconvex optimization via weak subdifferentials
• An iterated eigenvalue algorithm for approximating roots of univariate polynomials
• A novel filled function method and quasi-filled function method for global optimization
• New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
• Generalizations of convex and related functions
• Unconstrained and constrained global optimization of polynomial functions in one variable
• Global optimization using interval analysis: The one-dimensional case
• Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
• Handbook of global optimization. Vol. 2
• Optimality conditions and optimization methods for quartic polynomial optimization
• Polynomials. Translated from the second Russian edition by Dimitry Leites.
• Integral global minimization: Algorithms, implementations and numerical tests
• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
• Optimality and duality in nonlinear programming involving semilocally B-preinvex and related functions
• Experimental testing of advanced scatter search designs for global optimization of multimodal functions
• The Tunneling Algorithm for the Global Minimization of Functions
• Global Continuation for Distance Geometry Problems
• Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
• Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
• Nonlinear Programming

This page was built for publication: Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials