Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Dong Hui Fang / rank
Normal rank
 
Property / author
 
Property / author: Ng Kung-fu / rank
Normal rank
 
Property / author
 
Property / author: Dong Hui Fang / rank
 
Normal rank
Property / author
 
Property / author: Ng Kung-fu / rank
 
Normal rank
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.2010.04.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048105128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Farkas-type constraint qualifications in convex infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent contributions to linear semi-infinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constraint Qualification for an Infinite System of Convex Inequalities in a Banach Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong CHIP for Infinite System of Closed Convex Sets in Normed Linear Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Qualifications for Semi-Infinite Systems of Convex Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality gap of the conic convex constrained optimization problems in normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong and total Lagrange duality for convex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New regularity conditions for strong and total Fenchel-Lagrange duality in infinite dimensional spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: An alternative formulation for a new closed cone constraint qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Lagrangian conditions for convex programs with applications to semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong conical hull intersection property for convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint qualifications characterizing Lagrangian duality in convex optimization / 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: Complete characterizations of stable Farkas' lemma and cone-convex programming duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Global Approach to Nonlinearly Constrained Best Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new Farkas-type results for inequality systems with DC functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3515805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualification and optimality conditions for dc programs with infinite constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Stability of the Feasible Set in Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On best uniform restricted range approximation in complex-valued continuous function spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On best restricted range approximation in continuous complex-valued function spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: First- and Second-Order Epi-Differentiability in Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Conditions via Quasi-Relative Interior in Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3149262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Liberating the subgradient optimality conditions from constraint qualifications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:59, 3 July 2024

scientific article
Language Label Description Also known as
English
Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
scientific article

    Statements

    Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    convex inequality system
    0 references
    optimality condition
    0 references
    total Lagrangian duality
    0 references
    conic programming
    0 references
    0 references
    0 references
    0 references
    0 references