ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
Collection
Publisher
Years
  • 1
    Electronic Resource
    Electronic Resource
    On the convergence of SUMT (1974)
    Springer
    Mathematical programming 6 (1974), S. 360-364 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper investigates some convergence properties of Fiacco and McCormick's SUMT algorithm. A convex programming problem is given for which the SUMT algorithm generates a unique unconstrained minimizing trajectory having an infinite number of accumulation points, each a global minimizer to the original convex programming problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580251
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Theorems on the decomposition of a large nonlinear convex separable economic system in the dual direction (1978)
    Springer
    Economic change & restructuring 14 (1978), S. 45-53 
    Details
    ISSN: 1574-0277
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract Large mathematical programming problems often arise as the result of the economic planning process. When such a problem is not only large, but nonlinear as well, there is a need to make it more manageable by breaking it down into several smaller and more easily handled subproblems. The subproblems are solved separately with the coordination activity carried out by a “master problem”. A decomposition method can be seen as a “dialogue” between the master problem and the subproblems, where the flow of information back and forth between the former and the latters results in a series of approximations converging to the solution of the overall problem. Such a decomposition method was elaborated by Benders [1] for linear programmes and generalized to nonlinear convex separable programmes by Kronsjö [4] and by Geoffrion [3]. After considering our basic nonlinear programming problem from a two-stage minimization point of view, we review the Kronsjö nonlinear decomposition algorithm. Then we establish some properties of a function related to this algorithm.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00150380
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    A nonlinear decomposition algorithm (1978)
    Springer
    Economic change & restructuring 14 (1978), S. 115-124 
    Details
    ISSN: 1574-0277
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00578336
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Theorems related to symmetric nonlinear decomposition (1978)
    Springer
    Economic change & restructuring 14 (1978), S. 167-170 
    Details
    ISSN: 1574-0277
    Source: Springer Online Journal Archives 1860-2000
    Topics: Economics
    Notes: Abstract Decomposition methods can provide the rescue from the “curse of dimensionality”, which often prevents the successful numerical solution of large scale nonlinear mathematical programming problems. A symmetric nonlinear decomposition theory has been elaborated by T.O.M. Kronsjö (4) as an extension of a theory by the same author (3). The stringent proof of the convergence of this decomposition algorithm requires some results on necessary optimality conditions for certain mathematical programming problems. In this paper we state and prove some theorems providing these results.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00367146
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...