Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
type: Item
instance of: scholarly article
title: Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
zbMATH Open document ID: 1390.90452
author: Fusheng Bai
author: Jing Tian
author: Zhiyou Wu
published in: Journal of the Operations Research Society of China
publication date: 2018-03-28T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6853827
zbMATH Keywords: nonlinear programming
zbMATH Keywords: optimality conditions
zbMATH Keywords: linear transformation
zbMATH Keywords: Lagrange interpolating polynomials
zbMATH Keywords: global optimization method
describes a project that uses: Eigensolve
MaRDI profile type: Publication
full work available at URL: s40305-017-0157-3
OpenAlex ID: W2597862030
cites work: Unconstrained and constrained global optimization of polynomial functions in one variable
cites work: Q4040272
cites work: Q4889854
cites work: Q4833813
cites work: Integral global minimization: Algorithms, implementations and numerical tests
cites work: Q4353368
cites work: Global Continuation for Distance Geometry Problems
cites work: The Tunneling Algorithm for the Global Minimization of Functions
cites work: A novel filled function method and quasi-filled function method for global optimization
cites work: Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization
cites work: Handbook of global optimization. Vol. 2
cites work: Generalizations of convex and related functions
cites work: Optimality and duality in nonlinear programming involving semilocally B-preinvex and related functions
cites work: New optimality conditions and duality results of \(G\) type in differentiable mathematical programming
cites work: Optimality conditions in nonconvex optimization via weak subdifferentials
cites work: A new local and global optimization method for mixed integer quadratic programming problems
cites work: Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables
cites work: Optimality conditions and optimization methods for quartic polynomial optimization
cites work: Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
cites work: Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
cites work: Q3950972
cites work: Nonlinear Programming
cites work: Global Minimization of Normal Quartic Polynomials Based on Global Descent Directions
cites work: Polynomials. Translated from the second Russian edition by Dimitry Leites.
cites work: Q5432956
cites work: Global optimization using interval analysis: The one-dimensional case
cites work: An iterated eigenvalue algorithm for approximating roots of univariate polynomials
cites work: Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
cites work: Experimental testing of advanced scatter search designs for global optimization of multimodal functions
DOI: 10.1007/S40305-017-0157-3
description: scientific article; zbMATH DE number 6853827