A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints

MATHEMATICAL PROGRAMMING (PRINT);
MATH PROGRAM (PRINT)

dc.creatorFlores-Bazan, Fabian
dc.creatorCarcamo, Gabriel
dc.date2014
dc.date2016-11-29T19:28:54Z
dc.date2022-07-05T18:35:17Z
dc.date2016-11-29T19:28:54Z
dc.date2022-07-05T18:35:17Z
dc.date2014
dc.date.accessioned2023-08-23T00:36:48Z
dc.date.available2023-08-23T00:36:48Z
dc.identifier1436-4646
dc.identifier1120980
dc.identifier1120980
dc.identifier0025-5610
dc.identifierhttps://hdl.handle.net/10533/127848
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/8355794
dc.description2
dc.descriptionFONDECYT
dc.descriptionfflores@ing-mat.udec.cl; gabcarcamo@udec.cl
dc.description1/2
dc.descriptionFONDECYT
dc.description145
dc.languageeng
dc.publisherSPRINGER SCIENCE
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.relationinstname: Conicyt
dc.relationreponame: Repositorio Digital RI2.0
dc.relationinfo:eu-repo/grantAgreement/Fondecyt/1120980
dc.relationinfo:eu-repo/semantics/dataset/hdl.handle.net/10533/93477
dc.relationhttps://doi.org/10.1007/s10107-013-0647-y
dc.rightsinfo:eu-repo/semantics/openAccess
dc.titleA geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
dc.titleMATHEMATICAL PROGRAMMING (PRINT)
dc.titleMATH PROGRAM (PRINT)
dc.typeArticulo
dc.typeinfo:eu-repo/semantics/article
dc.typeinfo:eu-repo/semantics/publishedVersion
dc.coverageHEIDELBERG


Este ítem pertenece a la siguiente institución