Necessary and sufficient conditions for regularity of constraints in convex programming (Q4327951): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/02331939208843830 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075349532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of optimality without constraint qualification for the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Necessary and Sufficient Qualification for Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of optimality conditions and constraint qualifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions for nondifferentiable convex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity conditions for constrained extremum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new constraint qualification condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saddlepoints for convex programming in order vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of optimality conditions and constraint qualifications: The convex case / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimality condition for a nondifferentiable convex program / rank
 
Normal rank

Latest revision as of 12:28, 23 May 2024

scientific article; zbMATH DE number 737365
Language Label Description Also known as
English
Necessary and sufficient conditions for regularity of constraints in convex programming
scientific article; zbMATH DE number 737365

    Statements

    Necessary and sufficient conditions for regularity of constraints in convex programming (English)
    0 references
    0 references
    0 references
    20 April 1995
    0 references
    0 references
    necessary and sufficient conditions
    0 references
    nondifferentiable convex programming
    0 references
    weakest constraint qualifications
    0 references
    outer normal cones
    0 references
    directional derivatives
    0 references
    epigraph
    0 references
    0 references