Optimization and Operations Research Proceedings of a Conference Held at Oberwolfach, July 27–August 2, 1975
The variable metric algorithm is widely recognised as one of the most efficient ways of solving the following problem:- Locate x* a local minimum point n ( 1) of f(x) x E R Considerable attention has been given to the study of the convergence prop- ties of this algorithm especially for the case wher...
| Other Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1976, 1976
|
| Edition: | 1st ed. 1976 |
| Series: | Lecture Notes in Economics and Mathematical Systems
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- Reduction and Decomposition of Modulo Optimization Problems
- Optimization of Elastic Structures by Mathematical Programming Techniques
- On Closed Sets Having a Least Element
- On the Convergence of the Variable Metric Method with Numerical Derivatives and the Effect of Noise in the Function Evaluation
- Parallel Path Strategy. Theory and Numerical Illustrations
- On Minimization under Linear Equality Constraints
- On Constrained Shortest-Route Problems
- Bang-Bang Solution of a Control Problem for the Heat Equation
- Generalized Stirling-Newton Methods
- On a Method for Computing Pseudoinverses
- Charakterisierung lokaler Pareto-Optima
- On the Exact Evaluation of Finite Activity Networks with Stochastic Durations of Activities
- Approximation of a Parabolic Boundary Control Problem by the Line Method
- Regularisation of Optimization Problems and Operator Equations
- Some Extensions of Linearly Constrained Nonlinear Programming
- Boundary Control of the Higher-Dimensional Wave Equation
- Nondifferentiable Optimisation. Subgradient and ? — Subgradient Methods
- Approximations to Stochastic Optimization Problems
- Models in Resource Allocation — Trees of Queues
- Dual Methods in Convex Control Problems
- A Subgradient Algorithm for Solving K-convex Inequalities
- Computation of Bang-Bang-Controls and Lower Bounds for a Parabolic Boundary-Value Control Problem
- Numerical Solution of Systems of Nonlinear Inequalities
- Lower Bounds and Inclusion Balls for the Solution of Locally Uniformly Convex Optimization Problems
- Über Vektormaximierung und Analyse der Gewichtung von Subzielen
- Preference Optimality
- Decomposition Procedures for Convex Programs