Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time

From MaRDI portal
Revision as of 22:02, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3200131

DOI10.1137/0328046zbMath0714.49036OpenAlexW1987064381MaRDI QIDQ3200131

Roger J.-B. Wets, R. Tyrrell Rockafellar

Publication date: 1990

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/4b07e0bb9a81db9642bd5489533f826111d3af94




Related Items (39)

Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problemsA generator and a simplex solver for network piecewise linear programsOn the structure of convex piecewise quadratic functionsSequential convex programming for non-linear stochastic optimal controlA nonsmooth version of Newton's methodSolving large-scale minimax problems with the primal-dual steepest descent algorithmComputational aspects in applied stochastic controlA parallel subgradient projection algorithm for quasiconvex equilibrium problems under the intersection of convex setsThe approximation of separable stochastic programsAn SQP algorithm for extended linear-quadratic problems in stochastic programmingMinimization of \(SC^ 1\) functions and the Maratos effectMultistage stochastic programming: Error analysis for the convex caseA new approach to stochastic linear programmingSensitivity analysis for generalized linear-quadratic problemsA predictor-corrector method for extended linear-quadratic programmingThe Josephy-Newton method for semismooth generalized equations and semismooth SQP for optimizationA note on upper Lipschitz stability, error bounds, and critical multipliers for Lipschitz-continuous KKT systemsAn asymmetric proximal decomposition method for convex programming with linearly coupling constraintsError bounds for vector-valued functions: necessary and sufficient conditionsA filter-trust-region method for LC 1 unconstrained optimization and its global convergenceVariational conditions and the proto-differentiation of partial subgradient mappingsThe iterative methods for monotone generalized variational inequalitiesAn interior point algorithm of O\((\sqrt m| \ln\varepsilon |)\) iterations for \(C^ 1\)-convex programmingModified proximal point algorithm for extended linear-quadratic programmingA globally and superlinearly convergent trust region method for \(LC^1\) optimization problemsProx-regular functions in Hilbert spacesDynamic portfolio optimization: time decomposition using the maximum principle with a scenario approachCombining stochastic programming and optimal control to decompose multistage stochastic optimization problemsLocal convergence of the method of multipliers for variational and optimization problems under the noncriticality assumptionA subgradient-type method for the equilibrium problem over the fixed point set and its applicationsRobust Quadratic Programming with Mixed-Integer UncertaintyComputational schemes for large-scale problems in extended linear- quadratic programmingSemismooth SQP method for equality-constrained optimization problems with an application to the lifted reformulation of mathematical programs with complementarity constraintsNewton's method and quasi-Newton-SQP method for general \(\text{LC}^1\) constrained optimizationSplitting-type method for systems of variational inequalitiesA discrete-time mean-field stochastic linear-quadratic optimal control problem with financial applicationInterior point methods for optimal control of discrete time systemsRandom test problems and parallel methods for quadratic programs and quadratic stochastic programsVariational composition of a monotone operator and a linear mapping with applications to elliptic PDEs with singular coefficients







This page was built for publication: Generalized Linear-Quadratic Problems of Deterministic and Stochastic Optimal Control in Discrete Time