On programming when the positive cone has an empty interior

Araujo, A. P. ; Monteiro, P. K.
Springer
Published 1990
ISSN:
1573-2878
Keywords:
Convex programming ; Lagrange multipliers ; subdifferentiability ; positive cones
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In this note, we present a condition which is equivalent to the existence of the Lagrange multiplier for the general convex programming problem. This condition enables one to study a hypothesis distinct from the one of nonempty interior of the positive cone of the space of restrictions that is commonly used. Simple examples of this condition are given. We also explore the relationship of this condition with the subdifferentiability of the primal functional.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00940482
_version_ 1798296688056598528
autor Araujo, A. P.
Monteiro, P. K.
autorsonst Araujo, A. P.
Monteiro, P. K.
book_url http://dx.doi.org/10.1007/BF00940482
datenlieferant nat_lic_papers
hauptsatz hsatz_simple
identnr NLM197983863
iqvoc_descriptor_keyword iqvoc_00000483:programming
iqvoc_descriptor_title iqvoc_00000483:programming
issn 1573-2878
journal_name Journal of optimization theory and applications
materialart 1
notes Abstract In this note, we present a condition which is equivalent to the existence of the Lagrange multiplier for the general convex programming problem. This condition enables one to study a hypothesis distinct from the one of nonempty interior of the positive cone of the space of restrictions that is commonly used. Simple examples of this condition are given. We also explore the relationship of this condition with the subdifferentiability of the primal functional.
package_name Springer
publikationsjahr_anzeige 1990
publikationsjahr_facette 1990
publikationsjahr_intervall 8009:1990-1994
publikationsjahr_sort 1990
publisher Springer
reference 67 (1990), S. 395-410
schlagwort Convex programming
Lagrange multipliers
subdifferentiability
positive cones
search_space articles
shingle_author_1 Araujo, A. P.
Monteiro, P. K.
shingle_author_2 Araujo, A. P.
Monteiro, P. K.
shingle_author_3 Araujo, A. P.
Monteiro, P. K.
shingle_author_4 Araujo, A. P.
Monteiro, P. K.
shingle_catch_all_1 Araujo, A. P.
Monteiro, P. K.
On programming when the positive cone has an empty interior
Convex programming
Lagrange multipliers
subdifferentiability
positive cones
Convex programming
Lagrange multipliers
subdifferentiability
positive cones
Abstract In this note, we present a condition which is equivalent to the existence of the Lagrange multiplier for the general convex programming problem. This condition enables one to study a hypothesis distinct from the one of nonempty interior of the positive cone of the space of restrictions that is commonly used. Simple examples of this condition are given. We also explore the relationship of this condition with the subdifferentiability of the primal functional.
1573-2878
15732878
Springer
shingle_catch_all_2 Araujo, A. P.
Monteiro, P. K.
On programming when the positive cone has an empty interior
Convex programming
Lagrange multipliers
subdifferentiability
positive cones
Convex programming
Lagrange multipliers
subdifferentiability
positive cones
Abstract In this note, we present a condition which is equivalent to the existence of the Lagrange multiplier for the general convex programming problem. This condition enables one to study a hypothesis distinct from the one of nonempty interior of the positive cone of the space of restrictions that is commonly used. Simple examples of this condition are given. We also explore the relationship of this condition with the subdifferentiability of the primal functional.
1573-2878
15732878
Springer
shingle_catch_all_3 Araujo, A. P.
Monteiro, P. K.
On programming when the positive cone has an empty interior
Convex programming
Lagrange multipliers
subdifferentiability
positive cones
Convex programming
Lagrange multipliers
subdifferentiability
positive cones
Abstract In this note, we present a condition which is equivalent to the existence of the Lagrange multiplier for the general convex programming problem. This condition enables one to study a hypothesis distinct from the one of nonempty interior of the positive cone of the space of restrictions that is commonly used. Simple examples of this condition are given. We also explore the relationship of this condition with the subdifferentiability of the primal functional.
1573-2878
15732878
Springer
shingle_catch_all_4 Araujo, A. P.
Monteiro, P. K.
On programming when the positive cone has an empty interior
Convex programming
Lagrange multipliers
subdifferentiability
positive cones
Convex programming
Lagrange multipliers
subdifferentiability
positive cones
Abstract In this note, we present a condition which is equivalent to the existence of the Lagrange multiplier for the general convex programming problem. This condition enables one to study a hypothesis distinct from the one of nonempty interior of the positive cone of the space of restrictions that is commonly used. Simple examples of this condition are given. We also explore the relationship of this condition with the subdifferentiability of the primal functional.
1573-2878
15732878
Springer
shingle_title_1 On programming when the positive cone has an empty interior
shingle_title_2 On programming when the positive cone has an empty interior
shingle_title_3 On programming when the positive cone has an empty interior
shingle_title_4 On programming when the positive cone has an empty interior
sigel_instance_filter dkfz
geomar
wilbert
ipn
albert
fhp
source_archive Springer Online Journal Archives 1860-2000
timestamp 2024-05-06T09:56:04.191Z
titel On programming when the positive cone has an empty interior
titel_suche On programming when the positive cone has an empty interior
topic SA-SP
uid nat_lic_papers_NLM197983863