Numerical computational methods of optimisation in control
From MaRDI portal
Publication:2540169
DOI10.1016/0005-1098(69)90096-XzbMath0197.44103OpenAlexW2472903605MaRDI QIDQ2540169
Publication date: 1969
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0005-1098(69)90096-x
Related Items
Approximation methods for the unconstrained optimization ⋮ Integrated system modeling and optimization via quasilinearization ⋮ Integrated system modeling and optimization via quasilinearization ⋮ A computational approach to the combined problem of optimization and parameter identification
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal stochastic control
- Quadratic control problem with an energy constraint: Approximate solutions
- The existence of optimal controls in the absence of convexity conditions
- A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems
- The Cutting-Plane Method for Solving Convex Programs
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- A Steepest-Ascent Method for Solving Optimum Programming Problems
- A Rapidly Convergent Descent Method for Minimization
- An efficient method for finding the minimum of a function of several variables without calculating derivatives
- Linear Control Processes and Mathematical Programming
- Nonlinear Programming: A Numerical Survey
- Irreducible Realizations and the Degree of a Rational Matrix
- Non-Linear Programming Via Penalty Functions
- Dual Control Strategies for Discrete State Markov Processes Part I
- Minimizing a function without calculating derivatives
- Convergence Conditions for Nonlinear Programming Algorithms
- Methods of conjugate gradients for solving linear systems
