Efficient controls for finitely convergent sequential algorithms
From MaRDI portal
Publication:2989096
DOI10.1145/1731022.1731024zbMATH Open1364.65003DBLPjournals/toms/ChenH10OpenAlexW2003797744WikidataQ34189810 ScholiaQ34189810MaRDI QIDQ2989096FDOQ2989096
Authors: Wei Chen, Gabor T. Herman
Publication date: 19 May 2017
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2952966
Recommendations
- Dynamical control of converging sequences computation
- Fast-convergence algorithms for linear time-optimal control
- Convergence of the method of sequential synthesis of time-optimal control
- scientific article; zbMATH DE number 1535924
- Efficient algorithms for solving large-scale computational control problems of repetitive processes
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- Optimal control of stochastic sequences with constraints
- A successive approximation algorithm for stochastic control problems
- scientific article; zbMATH DE number 4102918
feasibility problemfinite convergencesequential algorithmalgebraic reconstruction techniquecyclic subgradient projections
Cited In (5)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems
- Stateless Near Optimal Flow Control with Poly-logarithmic Convergence
- Finite convergence of a subgradient projections method with expanding controls
- The method of cyclic intrepid projections: convergence analysis and numerical experiments
This page was built for publication: Efficient controls for finitely convergent sequential algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989096)