A global optimization algorithm using Lagrangian underestimates and the interval Newton method
type: Item
instance of: scholarly article
title: A global optimization algorithm using Lagrangian underestimates and the interval Newton method
zbMATH Open document ID: 1046.90067
DOI: 10.1023/A:1020383700229
author: Tim Van Voorhis
published in: Journal of Global Optimization
publication date: 2003-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C53
Mathematics Subject Classification ID: 90C46
Mathematics Subject Classification ID: 65G40
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 1924948
zbMATH Keywords: Lagrangian dual
zbMATH Keywords: Interval Newton method
zbMATH Keywords: Convex underestimate
zbMATH Keywords: Quadratically constrained quadratic program
describes a project that uses: INTOPT_90
MaRDI profile type: Publication
full work available at URL: a:1020383700229
OpenAlex ID: W171437468
Recommended article: A new interval approach to global optimization
Recommended article: Q5322697
Recommended article: Q4657619
Recommended article: Q4855843
Recommended article: An interval algorithm for constrained global optimization
Recommended article: An interval algorithm for nondifferentiable global optimization
Recommended article: An interval global optimization algorithm for a class of functions with several variables
Recommended article: Interval methods for global optimization
Recommended article: Q4463128
Recommended article: Q4505720
description: scientific article; zbMATH DE number 1924948