Necessary conditions for discrete dynamical systems with delays and general constraints
Jaroslav Doležal (1981)
Kybernetika
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Necessary optimality conditions for discrete systems with state-dependent control region”
Necessary conditions for discrete dynamical systems with delays and general constraints
Optimization problems with convex epigraphs. Application to optimal control
Arkadii Kryazhimskii (2001)
International Journal of Applied Mathematics and Computer Science
Similarity:
For a class of infinite-dimensional minimization problems with nonlinear equality constraints, an iterative algorithm for finding global solutions is suggested. A key assumption is the convexity of the ''epigraph'', a set in the product of the image spaces of the constraint and objective functions. A convexification method involving randomization is used. The algorithm is based on the extremal shift control principle due to N.N. Krasovskii. An application to a problem of optimal control...
Robust control of discrete-time hybrid systems with uncertain modal dynamics.
Runolfsson, Thordur (2004)
Mathematical Problems in Engineering
Similarity:
Optimal control of nonlinear delay systems with implicit derivative and quadratic performance
Krishnan Balachandran, N. Rajagopal (1999)
Kybernetika
Similarity:
The existence of optimal control for nonlinear delay systems having an implicit derivative with quadratic performance criteria is proved. The results are established by an iterative technique and using the Darbo fixed point theorem.
Two-phase generalized reduced gradient method for constrained global optimization.
El Mouatasim, Abdelkrim (2010)
Journal of Applied Mathematics
Similarity:
Convergence of prox-regularization methods for generalized fractional programming
Ahmed Roubi (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
We analyze the convergence of the prox-regularization algorithms introduced in [1], to solve generalized fractional programs, without assuming that the optimal solutions set of the considered problem is nonempty, and since the objective functions are variable with respect to the iterations in the auxiliary problems generated by Dinkelbach-type algorithms DT1 and DT2, we consider that the regularizing parameter is also variable. On the other hand we study the convergence when the iterates...