Numerical computational methods of optimisation in control
From MaRDI portal
Cites work
- A nonlinear programming technique for the optimization of continuous processing systems
- A Rapidly Convergent Descent Method for Minimization
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Convergence Conditions for Nonlinear Programming Algorithms
- Dual Control Strategies for Discrete State Markov Processes Part I
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3704299 (Why is no real title available?)
- scientific article; zbMATH DE number 3441171 (Why is no real title available?)
- scientific article; zbMATH DE number 3206520 (Why is no real title available?)
- scientific article; zbMATH DE number 3242547 (Why is no real title available?)
- scientific article; zbMATH DE number 3251929 (Why is no real title available?)
- Irreducible Realizations and the Degree of a Rational Matrix
- Linear Control Processes and Mathematical Programming
- Methods of conjugate gradients for solving linear systems
- Minimizing a function without calculating derivatives
- Non-Linear Programming Via Penalty Functions
- Nonlinear Programming: A Numerical Survey
- Optimal stochastic control
- Quadratic control problem with an energy constraint: Approximate solutions
- The Cutting-Plane Method for Solving Convex Programs
- The existence of optimal controls in the absence of convexity conditions
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
Cited in
(4)
This page was built for publication: Numerical computational methods of optimisation in control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2540169)