scientific article

zbMath0555.49001MaRDI QIDQ3218674

Jochen Werner

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convex optimizationweak and strong dualityoptimality conditionsseparation theoremsfinite dimensional linear programmingsubdifferentiability

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Existence theories for problems in abstract spaces (49J27) Mathematical programming (90Cxx) Optimality conditions for problems involving ordinary differential equations (49K15) Optimality conditions for problems in abstract spaces (49K27) Hamilton-Jacobi theories (49L99) Existence theories in calculus of variations and optimal control (49Jxx) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01) Numerical methods in optimal control (49Mxx)

Related Items

About existence and uniqueness of the restricted total least squares estimation ⋮ Dualization and discretization of linear-quadratic control problems with bang-bang solutions ⋮ Stability of perturbed optimization problems with applications to parameter estimation ⋮ On the necessary conditions for optimal control of retarded systems ⋮ Optimal control of a system governed by a parabolic equation with an infinite number of variables and time delay ⋮ Pontryagin principles in infinite horizon in the presence of asymptotical constraints ⋮ A Note on the core topology used in optimization ⋮ Linearizing equations with state-dependent delays ⋮ Optimal control problem for variable-order fractional differential systems with time delay involving Atangana-Baleanu derivatives ⋮ Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints ⋮ Inverse gravimetry: background material and multiscale mollifier approaches ⋮ Programming with semilocally convex functions ⋮ Infinite dimensional infinite-horizon Pontryagin principles for discrete-time problems ⋮ Foundations of Set-Semidefinite Optimization ⋮ Linearly constrained reconstruction of functions by kernels with applications to machine learning ⋮ Bilevel Optimal Control With Final-State-Dependent Finite-Dimensional Lower Level ⋮ On the Intrinsic Core of Convex Cones in Real Linear Spaces ⋮ Inverse Gravimetry as an Ill-Posed Problem in Mathematical Geodesy ⋮ An efficient support vector machine learning method with second-order cone programming for large-scale problems ⋮ Discretization methods for the solution of semi-infinite programming problems