An alternative formulation for a new closed cone constraint qualification (Q2492444): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.na.2005.06.041 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2064099700 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrange multiplier theorem and a sandwich theorem for convex relations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fenchel-Lagrange duality versus geometric duality in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong duality for generalized convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Farkas-Type Results With Conjugate Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple closure condition for the normal cone intersection formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4104377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequality systems and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Slater's constraint qualification for infinite convex programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic conditions for weak and proper optimality in infinite dimensional convex vector optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4050397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of constraint qualifications in infinite-dimensional convex programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:43, 24 June 2024

scientific article
Language Label Description Also known as
English
An alternative formulation for a new closed cone constraint qualification
scientific article

    Statements

    An alternative formulation for a new closed cone constraint qualification (English)
    0 references
    0 references
    0 references
    9 June 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    convex optimization
    0 references
    constraint qualifications
    0 references
    conjugate duality
    0 references
    weak and strong duality
    0 references
    0 references