Show simple item record

Article

dc.creatorCarrizosa Priego, Emilio Josées
dc.date.accessioned2021-04-23T09:22:23Z
dc.date.available2021-04-23T09:22:23Z
dc.date.issued2001-04-01
dc.identifier.citationCarrizosa Priego, E.J. (2001). An optimal bound for d.c. programs with convex constraints. Mathematical Methods of Operations Research volume, 54, 47-51.
dc.identifier.issn1432-2994es
dc.identifier.issn1432-5217es
dc.identifier.urihttps://hdl.handle.net/11441/107628
dc.description.abstractA well-known strategy for obtaining a lower bound on the minimum of a d.c. function f−g over a compact convex set S⊂ℝn consists of replacing the convex function f by a linear minorant at x 0∈S. In this note we show that the x 0 * giving the optimal bound can be obtained by solving a convex minimization program, which corresponds to a Lagrangian decomposition of the problem. Moreover, if S is a simplex, the optimal Lagrangian multiplier can be obtained by solving a system of n + 1 linear equations.es
dc.formatapplication/pdfes
dc.format.extent4 p.es
dc.language.isoenges
dc.publisherSpringeres
dc.relation.ispartofMathematical Methods of Operations Research volume, 54, 47-51.
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 Internacional*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectLagrangian decompositiones
dc.subjectboundses
dc.subjectd.c. programses
dc.titleAn optimal bound for d.c. programs with convex constraintses
dc.typeinfo:eu-repo/semantics/articlees
dc.type.versioninfo:eu-repo/semantics/publishedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Estadística e Investigación Operativaes
dc.relation.publisherversionhttp://doi.org/10.1007/PL00003997es
dc.identifier.doi10.1007/PL00003997es
dc.contributor.groupUniversidad de Sevilla. FQM329: Optimizaciónes
dc.journaltitleMathematical Methods of Operations Research volumees
dc.publication.volumen54es
dc.publication.initialPage47es
dc.publication.endPage51es

FilesSizeFormatViewDescription
An optimal bound for d.c. programs ...58.82KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Except where otherwise noted, this item's license is described as: Attribution-NonCommercial-NoDerivatives 4.0 Internacional