The infinite dimensional Lagrange multiplier rule for convex optimization problems

From MaRDI portal
Publication:719485

DOI10.1016/j.jfa.2011.06.006zbMath1238.46057OpenAlexW1977416643MaRDI QIDQ719485

Maria Bernadette Donato

Publication date: 10 October 2011

Published in: Journal of Functional Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jfa.2011.06.006




Related Items (19)

On the study of an economic equilibrium with variational inequality argumentsAn extension of the basic constraint qualification to nonconvex vector optimization problemsEvolutionary variational inequality with long-term memory and applications to economic networksExistence and Approximation for Variational Problems Under Uniform Constraints on the Gradient by Power PenaltyOn the minimum bisection of random 3-regular graphsVariational Methods for Emerging Real–Life and Environmental Conservation ProblemsPollution control quasi-equilibrium problems with joint implementation of environmental projectsCooperation in pollution control problems via evolutionary variational inequalitiesDuality theory and applications to unilateral problemsLagrange multipliers and non-constant gradient constrained problemGeneralized Lagrange multiplier rule for non-convex vector optimization problemsOn the use of the quasi-relative interior in optimizationAn Adverse Selection Approach to Power PricingLagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued mapsOn generalized Nash equilibrium in infinite dimension: the Lagrange multipliers approachA quasi-variational approach for the dynamic oligopolistic market equilibrium problemA new necessary and sufficient condition for the strong duality and the infinite dimensional Lagrange multiplier ruleVariational Problem, Generalized Convexity, and Application to a Competitive Equilibrium ProblemNon-Convex Strong Duality Via Subdifferential



Cites Work


This page was built for publication: The infinite dimensional Lagrange multiplier rule for convex optimization problems