An optimal bound for d. c. programs with convex constraints
type: Item
instance of: scholarly article
title: An optimal bound for d. c. programs with convex constraints
zbMATH Open document ID: 1031.90050
DOI: 10.1007/PL00003997
published in: Mathematical Methods of Operations Research
publication date: 2003-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 1950144
zbMATH Keywords: d.c. programs
zbMATH Keywords: bounds
zbMATH Keywords: Lagrangian decomposition
author: Emilio Carrizosa
MaRDI profile type: Publication
Recommended article: A closedness condition and its applications to DC programs with convex constraints
Recommended article: Q3515805
Recommended article: A necessary and sufficient constraint qualification for DC programming problems with convex inequality constraints
Recommended article: Optimality conditions and duality for DC programming in locally convex spaces
Recommended article: Optimality conditions for DC programming problems with reverse convex constraints
Recommended article: Optimality conditions in DC-constrained mathematical programming problems
Recommended article: Convex analysis approach to d. c. programming: Theory, algorithms and applications
Recommended article: Characterizing global optimality for DC optimization problems under convex inequality constraints
Recommended article: Optimality conditions in DC-constrained optimization
Recommended article: DC semidefinite programming and cone constrained DC optimization. I: Theory
description: scientific article; zbMATH DE number 1950144