ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (29)
  • Linear Programming  (16)
  • optimal control  (13)
  • Springer  (29)
  • American Chemical Society
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • Periodicals Archive Online (PAO)
  • Wiley
  • 2005-2009
  • 1990-1994
  • 1980-1984  (29)
  • 2008
  • 1982  (18)
  • 1980  (11)
  • Mathematik  (29)
  • Philosophie
  • Werkstoffwissenschaften, Fertigungsverfahren, Fertigung
  • Energietechnik
Sammlung
  • Artikel  (29)
Verlag/Herausgeber
  • Springer  (29)
  • American Chemical Society
  • Annual Reviews
  • Blackwell Publishing Ltd
  • Elsevier
  • +
Erscheinungszeitraum
  • 2005-2009
  • 1990-1994
  • 1980-1984  (29)
Jahr
Thema
  • Mathematik  (29)
  • Philosophie
  • Werkstoffwissenschaften, Fertigungsverfahren, Fertigung
  • Energietechnik
  • Informatik  (16)
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 22 (1982), S. 93-103 
    ISSN: 1436-4646
    Schlagwort(e): Linear Programming ; Relaxation Method ; Polynomiality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A class of linear programs is given in which the relaxation method for inequalities, under the same operating rules as Khacian's method, is not polynomial in the length of the input. This result holds for any value of the relaxation parameter.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 22 (1982), S. 12-38 
    ISSN: 1436-4646
    Schlagwort(e): Graph ; Matching ; Branching ; Linear Programming ; Polyhedron
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Matching forests generalize branchings in a directed graph and matchings in an undirected graph. We present an efficient algorithm, the PMF Algorithm, for the problem: given a mixed graphG and a real weight on each of its edges, find a perfect matching forest of maximum weight-sum. The PMF Algorithm proves the sufficiency of a linear system which definesP = (G) andP(G), the convex hull of incidence vectors of perfect matching forests and matching forests respectively ofG. The algorithm also provides a generalization of Tutte's theorem on the existence of perfect matchings in an undirected graph.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 18 (1980), S. 308-329 
    ISSN: 1436-4646
    Schlagwort(e): Polytopes ; Linear Programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract This paper provides answers to several questions raised by V. Klee regarding the efficacy of Mattheiss' algorithm for finding all vertices of convex polytopes. Several results relating to the expected properties of polytopes are given which indicate thatn-polytopes defined by “large” numbers of constraints are difficult to obtain by random processes, the expected value of the number of vertices of polytope is considerably less than Klee's least upper bound the expected performance of Mattheiss' algorithm is far better than Klee's upper bound would suggest.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 18 (1980), S. 1-6 
    ISSN: 1436-4646
    Schlagwort(e): Discrete Dynamic Programming ; Optimal Markov Chains ; Linear Programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract It is shown how a discrete Markov programming problem can be transformed, using a linear program, into an equivalent problem from which the optimal decision rule can be trivially deduced. This transformation is applied to problems which have either transient probabilities or discounted costs.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 23 (1982), S. 1-19 
    ISSN: 1436-4646
    Schlagwort(e): Ellipsoid Algorithm ; Linear Programming ; Polynomial Boundedness ; Khachian's Method ; Linear Inequalities
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract We give some modifications of the ellipsoid algorithm for linear programming and describe a numerically stable implementation. We are concerned with practical problems where user-supplied bounds can usually be provided. Our implementation allows constraint dropping and updates bounds on the optimal value, and should be able to terminate with an indication of infeasibility or with a provably good feasible solution in a moderate number of iterations.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 22 (1982), S. 1-11 
    ISSN: 1436-4646
    Schlagwort(e): Graph ; Matching ; Branching ; Linear Programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract We introduce the concept of matching forests as a generalization of branchings in a directed graph and matchings in an undirected graph. Given special weights on the edges of a mixed graph, we present an efficient algorithm for finding an optimum weight-sum matching forest. The algorithm is a careful application of known branching and matching algorithms. The maximum cardinality matching forest problem is solved as a special case.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 23 (1982), S. 34-49 
    ISSN: 1436-4646
    Schlagwort(e): Linear Programming ; Variable Upper Bounds ; Degeneracy ; Triangular Factorization
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Special methods for dealing with constraints of the formx j ≤ x k , called variable upper bounds, were introduced by Schrage. Here we describe a method that circumvents the massive degeneracy inherent in these constraints and show how it can be implemented using triangular basis factorizations.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 23 (1982), S. 274-313 
    ISSN: 1436-4646
    Schlagwort(e): Large-Scale Optimization ; Linear Programming ; Staircase Linear Programs ; Simplex Method
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract This and a companion paper consider how current implementations of the simplex method may be adapted to better solve linear programs that have a staged, or ‘staircase’, structure. The present paper looks at ‘inversion’ routines within the simplex method, particularly those for sparse triangular factorization of a basis by Gaussian elimination and for solution of triangular linear systems. The succeeding paper examines ‘pricing’ routines. Both papers describe extensive (though preliminary) computational experience, and can point to some quite promising results.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 18 (1980), S. 49-61 
    ISSN: 1436-4646
    Schlagwort(e): Linear Programming ; Simplex Method ; Large-scale Programming ; Sparse Matrices ; Triangular Factorization of the Basis ; Partitioning Methods
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A dynamic factorization algorithm is developed which algebraically partitions the basis inverse in such a manner so that the simplex method can be executed from a series of small inverses and the basis itself. This partition is maintained dynamically so that the additional memory required to represent the basis inverse reduces to this series of small inverses for in-core implementations. The algorithm is intended for use in solving general large-scale linear programming problems. This new method of basis representation should permit rather large problems to be solved completely in-core. Preliminary computational experience is presented and comparisons are made with Reid's sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases. The computational experience indicated that a significant reduction in memory requirements can usually be obtained using the dynamic factorization approach with only a slight (up to about 20%) degradation of execution time.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 24 (1982), S. 39-54 
    ISSN: 1436-4646
    Schlagwort(e): Random Polytopes ; Linear Programming ; Problem Generation ; Aggregate Polytope Properties
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract The definition of random polytope adopted in this paper restricts consideration to those probability measures satisfying two properties. First, the measure must induce an absolutely continuous distribution over the positions of the bounding hyperplanes of the random polytope; and second, it must result in every point in the space being equally as likely as any other point of lying within the random polytope. An efficient Monte Carlo method for their computer generation is presented together with analytical formulas characterizing their aggregate properties. In particular, it is shown that the expected number of extreme points for such random polytopes increases monotonically in the number of constraints to the limiting case of a polytope topologically equivalent to a hypercube. The implied upper bound of 2 n wheren is the dimensionality of the space is significantly less than McMullen's attainable bound on the maximal number of vertices even for a moderate number of constraints.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 11
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 19 (1980), S. 239-254 
    ISSN: 1436-4646
    Schlagwort(e): Linear Programming ; LU Factorization ; Degeneracy ; Bartels—Golub Updating
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract For general sparse linear programs two of the most efficient implementations of the LU factorization with Bartels—Golub updating are due to Reid and Saunders. This paper presents an alternative approach which achieves fast execution times for degenerate simplex method iterations, especially when used with multiple pricing. The method should have wide applicability since the simplex method performs a high proportion of degenerate iterations on most practical problems. A key feature of Saunders' method is combined with the updating strategy of Reid so as to make the scheme suitable for implementation out of core. Its efficiency is confirmed by experimental results.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 12
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 24 (1982), S. 314-325 
    ISSN: 1436-4646
    Schlagwort(e): Stochastic Programming ; Linear Programming ; Expected Value of Perfect Information
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Stochastic linear programs have been rarely used in practical situations largely because of their complexity. In evaluating these problems without finding the exact solution, a common method has been to find bounds on the expected value of perfect information. In this paper, we consider a different method. We present bounds on the value of the stochastic solution, that is, the potential benefit from solving the stochastic program over solving a deterministic program in which expected values have replaced random parameters. These bounds are calculated by solving smaller programs related to the stochastic recourse problem.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 13
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 23 (1982), S. 138-147 
    ISSN: 1436-4646
    Schlagwort(e): Linear Programming ; Quadratic Programming ; Optimal Scaling ; Cells ; Balls ; Polyhedral ; Meet ; Containment
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract The concern is with solving as linear or convex quadratic programs special cases of the optimal containment and meet problems. The optimal containment or meet problem is that of finding the smallest scale of a set for which some translation contains a set or meets each element in a collection of sets, respectively. These sets are unions or intersections of cells where a cell is either a closed polyhedral convex set or a closed solid ball.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 14
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 23 (1982), S. 314-325 
    ISSN: 1436-4646
    Schlagwort(e): Sampling Techniques ; Linear Programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract A modification of the conventional simplex method has been developed for use on linear programming problems with large numbers of columns. The basic concept underlying the method is the trade-off between the cost of calculating many reduced costs and the increase in number of iterations resulting from calculating very vew. Under suitable assumptions a cost function can be constructed. The optimal choice of the number of reduced costs can then be computed by means of Dynamic Programming. Several approximated solutions are developed which are computationally simpler. Experiments on a number of problems indicate that the method may offer a promising technique for large-scale problems.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 15
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 24 (1982), S. 55-69 
    ISSN: 1436-4646
    Schlagwort(e): Linear Programming ; Sparse LU Decomposition ; Updating Ip Basis Factorizations ; Bartels—Golub Decomposition
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract We describe a sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases. It includes interchanges that, whenever this is possible, avoid the use of any eliminations (with consequent fill-ins) when revising the factorization at an iteration. Test results on some medium scale problems are presented and comparisons made with the algorithm of Forrest and Tomlin.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 16
    Digitale Medien
    Digitale Medien
    Springer
    Mathematical programming 24 (1982), S. 162-176 
    ISSN: 1436-4646
    Schlagwort(e): Polyhedral Convexity ; Tucker's Theorem ; Williams' Theorems ; Monotone Complementarity Problem ; Complementary Unboundedness ; Linear Programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract Three theorems of linear programming form our starting point: Tucker's theorem (1956) concerning the existence of optimal solutions satisfying the complementary slackness conditions strictly, and Williams' two theorems (1970) concerning the coordinatewise complementary behavior of feasible and optimal solutions. Here, we establish that the same phenomena hold in another, more versatile framework involving general polyhedral convexity. As one main application, the results are transferred into the context of the monotone complementarity problem. Several other theoretical applications are indicated.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 17
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 38 (1982), S. 83-96 
    ISSN: 1573-2878
    Schlagwort(e): Numerical methods ; multiple shooting method ; optimal control ; aircraft trajectories ; flight mechanics
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Three-dimensional minimum-time 180° turns of a fighter aircraft are computed for several initial velocitiesV 0 and altitudesh 0. It is shown that the optimum turns consist of split -S maneuvers forV 0≦V 10, three-dimensional maneuvers forV 10〈V 0〈V 20, and half-loops forV 0≧V 20, withV 10,V 20 being functions of altitude or thrust/weight ratio.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 18
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 30 (1980), S. 53-71 
    ISSN: 1573-2878
    Schlagwort(e): Parallel processing ; nonlinear two-point boundary-value problems ; optimal control ; parallel shooting ; parallel integration ; parallel minimization algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract This paper describes a collection of parallel optimal control algorithms which are suitable for implementation on an advanced computer with the facility for large-scale parallel processing. Specifically, a parallel nongradient algorithm and a parallel variablemetric algorithm are used to search for the initial costate vector that defines the solution to the optimal control problem. To avoid the computational problems sometimes associated with simultaneous forward integration of both the state and costate equations, a parallel shooting procedure based upon partitioning of the integration interval is considered. To further speed computations, parallel integration methods are proposed. Application of this all-parallel procedure to a forced Van der Pol system indicates that convergence time is significantly less than that required by highly efficient serial procedures.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 19
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 30 (1980), S. 137-147 
    ISSN: 1573-2878
    Schlagwort(e): Discontinuous differential equations ; optimal control ; Filippov solutions
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract When dealing with the time-optimal problem for linear control systems, there may be a difference between optimal open-loop control and corresponding synthesized feedback control, since in the latter case one is led to allow for generalized (Filippov) solutions. In this note, it is shown that the set of two-dimensional linear control systems with a convex polyhedron as control domain, which exhibit such paradoxical behavior (completely characterized by Brunovský), has a nonempty interior, in a natural and appropriately defined topology on the space of all such linear control systems.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 20
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 31 (1980), S. 195-205 
    ISSN: 1573-2878
    Schlagwort(e): State-variable discontinuities ; maximum principle ; fisheries management ; optimal control
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Consideration is given to continuous-time, parameter-dependent optimal control problems with state-variable jump discontinuities atN variable interior times. A maximum principle involving known costate jump conditions is stated and is proved by transforming the problem into a standard Mayer control problem. An illustrative example for fisheries management is included.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 21
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 31 (1980), S. 565-581 
    ISSN: 1573-2878
    Schlagwort(e): Boundary-value problems ; elliptic control problems ; multigrid methods ; numerical methods ; optimal control
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Elliptic control problems with a quadratic cost functional require the solution of a system of two elliptic boundary-value problems. We propose a fast iterative process for the numerical solution of this problem. The method can be applied to very special problems (for example, Poisson equation for a rectangle) as well as to general equations (arbitrary dimensions, general region). Also, nonlinear problems can be treated. The work required is proportional to the work taken by the numerical solution of a single elliptic equation.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 22
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 32 (1980), S. 17-37 
    ISSN: 1573-2878
    Schlagwort(e): Sensitivity analysis ; dynamic optimization ; optimal control ; near-optimal control ; Pontryagin's minimum principle
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract To find the optimal control of chemical processes, Pontryagin's minimum principle can be used. In practice, however, one is not only interested in the optimal solution, which satisfies the restrictions on the control, the initial and terminal conditions, and the process parameters. It is also important to known how the optimal control and the minimum value of the objective function change, due to small variations in all the restrictions and the parameters. It is shown how to determine the effect of these variations directly from the optimal solution. This saves computer time, compared with the more traditional sensitivity analysis based on computing the optimal control for every single variation considered. The theory is applied to a chemical process.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 23
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 32 (1980), S. 327-343 
    ISSN: 1573-2878
    Schlagwort(e): Linear systems ; quadratic costs ; regulator problem ; optimal control ; partial state information
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract The deterministic linear-system, quadratic-cost optimal control problem is considered when the only state information available is a partial linear observation of the initial statex 0. Thus, it is only known that the initial condition belongs to a particular linear variety. A control function is found which is optimal, in the sense (roughly) that (i) it can be computed using available information aboutx 0 and (ii) no other control function which can be found using that information gives lower cost than it does for every initial condition that could have given rise to the information. The optimal control can be found easily from the conventional Riccati equation of optimal control. Applications are considered in the presence of unknown exponential disturbances and to the case with a sequence of partial state observations.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 24
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 32 (1980), S. 577-593 
    ISSN: 1573-2878
    Schlagwort(e): Numerical methods ; computing methods ; optimal control ; optimality properties ; supplementary optimality properties ; gradient methods ; gradient-restoration algorithms ; sequential gradient-restoration algorithms ; general boundary conditions ; nondifferential constraints
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract In this paper, sequential gradient-restoration algorithms for optimal control problems are considered, and attention is focused on the gradient phase. It is shown that the Lagrange multipliers associated with the gradient phase not only solve the auxiliary minimization problem of the gradient phase, but are also endowed with a supplementary optimality property: they minimize the error in the optimality conditions, subject to the multiplier differential equations and boundary conditions, for given state, control, and parameter.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 25
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 37 (1982), S. 251-275 
    ISSN: 1573-2878
    Schlagwort(e): Economics ; political cycles ; discrete dynamic systems ; dynamic programming ; optimal control ; Poincaré mapping ; Stieltjes matrix ; optimization in Hilbert space ; infinite horizon ; turnpike theorem
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Under the hypothesis of a myopic electorate, vote-loss-minimizing behavior by the party in power, subject to a dynamic inflation-unemployment relation, is shown to generate an attractive, stable electoral policy cycle. The model presented is derived, with some improvements, from the analogous models of MacRae and Nordhaus. Furthermore, an attempt is made to specify the mathematical aspects of the problem by the Poincaré mapping.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 26
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 38 (1982), S. 111-135 
    ISSN: 1573-2878
    Schlagwort(e): Minimax problems ; minimax function ; minimax function depending on the state ; minimax function depending on the control ; optimal control ; minimax optimal control ; numerical methods ; computing methods ; transformation techniques ; gradient-restoration algorithms ; sequential gradient-restoration algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract In a previous paper (Part 1), we presented general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We considered two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P). In this paper, the transformation techniques presented in Part 1 are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer. Both the single-subarc approach and the multiple-subarc approach are employed. Three test problems characterized by known analytical solutions are solved numerically. It is found that the combination of transformation techniques and sequential gradient-restoration algorithm yields numerical solutions which are quite close to the analytical solutions from the point of view of the minimax performance index. The relative differences between the numerical values and the analytical values of the minimax performance index are of order 10−3 if the single-subarc approach is employed. These relative differences are of order 10−4 or better if the multiple-subarc approach is employed.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 27
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 38 (1982), S. 97-109 
    ISSN: 1573-2878
    Schlagwort(e): Minimax problems ; minimax function ; minimax function depending on the state ; minimax function depending on the control ; optimal control ; minimax optimal control ; numerical methods ; computing methods ; transformation techniques ; gradient-restoration algorithms ; sequential gradient-restoration algorithms
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract This paper contains general transformation techniques useful to convert minimax problems of optimal control into the Mayer-Bolza problem of the calculus of variations [Problem (P)]. We consider two types of minimax problems: minimax problems of Type (Q), in which the minimax function depends on the state and does not depend on the control; and minimax problems of Type (R), in which the minimax function depends on both the state and the control. Both Problem (Q) and Problem (R) can be reduced to Problem (P). For Problem (Q), we exploit the analogy with a bounded-state problem in combination with a transformation of the Jacobson type. This requires the proper augmentation of the state vectorx(t), the control vectoru(t), and the parameter vector π, as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized. For Problem (R), we exploit the analogy with a bounded-control problem in combination with a transformation of the Valentine type. This requires the proper augmentation of the control vectoru(t) and the parameter vector π, as well as the proper augmentation of the constraining relations. As a result of the transformation, the unknown minimax value of the performance index becomes a component of the parameter vector being optimized. In a subsequent paper (Part 2), the transformation techniques presented here are employed in conjunction with the sequential gradient-restoration algorithm for solving optimal control problems on a digital computer; both the single-subarc approach and the multiple-subarc approach are discussed.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 28
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 36 (1982), S. 409-417 
    ISSN: 1573-2878
    Schlagwort(e): Optimal design ; optimal control ; dynamic systems ; gantry cranes
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Problems arising in the optimal control of gantry crane instaliations are considered. Continuous controls to minimize a control squared objective function are obtained. The amplitude of in-plane oscillations of the suspended mass is assumed small. The optimal controls are sufficiently simple for practical realization.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 29
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 36 (1982), S. 521-534 
    ISSN: 1573-2878
    Schlagwort(e): Darboux points ; global optimality ; conjugate points ; optimal control
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract The question of the existence and the location of Darboux points (beyond which global optimality is lost) is crucial for minimal sufficient conditions for global optimality and for computation of optimal trajectories. Here, we investigate numerically the Darboux points and their relationship with conjugate points for a problem of minimum fuel, constant velocity, horizontal aircraft turns to capture a line. This simple second-order optimal control problem shows that ignoring the possible existence of Darboux points may play havoc with the computation of optimal trajectories.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...