Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A barrier function method for the nonconvex quadratic programming problem with box constraints

From MaRDI portal
Publication:5927660
Jump to:navigation, search

DOI10.1023/A:1008397325409zbMath0970.90059OpenAlexW1486913552MaRDI QIDQ5927660

Lei Xu, Chuangyin Dang

Publication date: 21 October 2001

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008397325409


zbMATH Keywords

global optimizationbarrier function methodbox constraintsnonconvex quadratic programming


Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)


Related Items (2)

Newton-KKT interior-point methods for indefinite quadratic programming ⋮ A polyhedral study of nonconvex quadratic programs with box constraints




This page was built for publication: A barrier function method for the nonconvex quadratic programming problem with box constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5927660&oldid=12070388"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki