well posed saddle point problems
well posed saddle point problems
Summary: We provide a new well-posedness concept for saddle-point problems. We characterize it by means of the behavior of the sublevel sets of an associated function. We then study the concave-convex case in Euclidean spaces. Applying these results in the setting of convex programming, we get a result on the convergence of the pair solution-Lagrange multiplier of approximating problems to the pair solution-Lagrange multiplier of the limit problem.
- University of Pavia Italy
- Polytechnic University of Milan Italy
Convex programming, CONVEX ANALYSIS, Optimality conditions for minimax problems, well-posedness, saddle-point problem, MINIMAX PROBLEMS, Sensitivity, stability, parametric optimization, WELL-POSEDNESS, Sensitivity, stability, well-posedness, 510, concave-convex problem
Convex programming, CONVEX ANALYSIS, Optimality conditions for minimax problems, well-posedness, saddle-point problem, MINIMAX PROBLEMS, Sensitivity, stability, parametric optimization, WELL-POSEDNESS, Sensitivity, stability, well-posedness, 510, concave-convex problem
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!