scientific article
From MaRDI portal
Publication:2753285
zbMath1003.49017MaRDI QIDQ2753285
Publication date: 26 September 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonsmooth analysis (49J52) Differentiation theory (Gateaux, Fréchet, etc.) on manifolds (58C20) Convexity of real functions of several variables, generalizations (26B25)
Related Items
Variational construction of connecting orbits, On Ellipsoidal Techniques for Reachability Analysis. Part I: External Approximations, On Ellipsoidal Techniques for Reachability Analysis. Part II: Internal Approximations Box-valued Constraints, Extensions of subgradient calculus with applications to optimization, Optimization techniques for state-constrained control and obstacle problems, Many multivariate records, Quasi-homogeneous domains and convex affine manifolds, Successive approximation and linear stability involving convergent sequences of optimization problems, Continuity of the approximate subdifferential, Multi-period risk sharing under financial fairness, Quasipolyhedral sets in linear semiinfinite inequality systems, A new multicomponent Poincaré-Beckner inequality, Infinite horizon asymptotic average optimality for large-scale parallel server networks, Dynamic optimization for reachability problems., Large deviations estimates for some non-local equations: fast decaying kernels and explicit bounds, Calcul sous-différentiel et optimisation, Extremum points of a convex function, Properties of the \(d\)-dimensional Earth mover's problem, Conjugate convex functions, duality, and optimal control problems. I: Systems governed by ordinary differential equations, Complementary variational principle and duality in mathematical programming, Extrémales du cône des matrices de type non négatif, à coefficients positifs ou nuls, Ellipsoidal techniques for reachability analysis: Internal approximation, Fenchel-Rockafellar type duality for a non-convex non-differential optimization problem, Optimality criteria for general unconstrained geometric programming problems
