Variational Principles and Well-Posedness in Optimization and Calculus of Variations
From MaRDI portal
Publication:4943735
DOI10.1137/S0363012998335632zbMath0997.49023OpenAlexW2089056180MaRDI QIDQ4943735
Alexander D. Ioffe, Zaslavski, Alexander J.
Publication date: 19 March 2000
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0363012998335632
Sensitivity, stability, well-posedness (49K40) Sensitivity, stability, parametric optimization (90C31) Metric spaces, metrizability (54E35)
Related Items
Analysis of multiplicity for a class of problems in calculus of variations, Generic well-posedness of variational problems without convexity assumptions, TWO POROSITY RESULTS IN MONOTONIC ANALYSIS, Nondifferentiability of a cost function at a point of minimum in minimax problems, Generic well-posedness of nonconvex constrained variational problems, Well-posed control problems related to second-order differential inclusions, Unnamed Item, Generic existence of solutions in vector optimization on metric spaces, Generic well-posedness for a class of equilibrium problems, Generic well-posedness of nonconvex optimal control problems, Well-Posedness in Unconstrained Polynomial Optimization Problems, Generic well-posedness of minimization problems with mixed continuous constraints., Generic well-posedness of constrained variational problems without convexity assumptions, Fragmentability of sequences of set-valued mappings with applications to variational principles, Density of the set of local minimizers for a generic cost function, Generic well-posedness of minimization problems with mixed smooth constraints, Existence of optimal controls in the absence of Cesari-type conditions for semilinear elliptic and parabolic systems, Existence of solutions of a vector optimization problem with a generic lower semicontinuous objective function, Inexact proximal point methods in metric spaces, On Well-Posedness for Perturbed Quasi-Equilibrium and Quasi-Optimization Problems, Typical convex program is very well posed, Well-posedness and porosity in the calculus of variations without convexity assumptions