Gradient methods on strongly convex feasible sets and optimal control of affine systems
DOI10.1007/S00245-018-9528-3OpenAlexW2894708175WikidataQ97093866 ScholiaQ97093866MaRDI QIDQ2187338FDOQ2187338
Authors: Phan Tu Vuong, Vladimir M. Veliov 
Publication date: 2 June 2020
Published in: Applied Mathematics and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00245-018-9528-3
Recommendations
- On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions
- Convergence of the gradient projection method in optimal control problems
- On the Gradient Projection Method for Optimal Control Problems with Nonnegative $\mathcal{L}^2 $ Inputs
- The method of projection of the gradient in problems of infinite-dimensional optimization
- scientific article; zbMATH DE number 3921351
mathematical programminggradient methodsnumerical methodsoptimal controlaffine control systemsbang-bang control
Convex programming (90C25) Numerical methods based on nonlinear programming (49M37) Existence of optimal solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49J30) Discrete approximations in optimal control (49M25) Linear-quadratic optimal control problems (49N10) Programming in abstract spaces (90C48)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Linear and nonlinear programming.
- Title not available (Why is that?)
- On Stability of Bang-Bang Type Controls
- Approximation and regularization of arbitrary functions in Hilbert spaces by the Lasry-Lions method
- Maximization of a function with Lipschitz continuous gradient
- About the Lipschitz property of the metric projection in the Hilbert space
- Title not available (Why is that?)
- Discretization of semilinear bang-singular-bang control problems
- Approximations of linear control problems with bang-bang solutions
- Error analysis of discrete approximations to bang-bang optimal control problems: the linear case
- Regularization and implicit Euler discretization of linear-quadratic optimal control problems with bang-bang solutions
- Convergence results for the discrete regularization of linear-quadratic control problems with bang-bang solutions
- Convex optimization in normed spaces. Theory, methods and examples
- Title not available (Why is that?)
- On the Time-Discretization of Control Systems
- Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
- Strong convexity of sets and functions
- On the convergence of the gradient projection method for convex optimal control problems with bang-bang solutions
- High order discrete approximations to Mayer's problems for linear systems
- Higher-order numerical scheme for linear quadratic problems with bang-bang controls
- Euler discretization for a class of nonlinear optimal control problems with control appearing linearly
- Metric regularity properties in bang-bang type linear-quadratic optimal control problems
- A Newton-type method and optimality test for problems with bang-singular-bang optimal control
Cited In (3)
This page was built for publication: Gradient methods on strongly convex feasible sets and optimal control of affine systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2187338)
