Library

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
  • 1
    Electronic Resource
    Electronic Resource
    An efficient one—dimensional search procedure for barrier functions (1973)
    Springer
    Mathematical programming 4 (1973), S. 279-296 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In minimizing interior penalty functions, most of the computational time is spent on the one-dimensional search. This paper presents a method for performing this search on barrier functions which is significantly faster than current techniques. The method exploits the special structure of barrier functions. Comparative computational results are given for a set of six test problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584671
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Solving a large nonlinear programming problem on a vector processing computer (1988)
    Springer
    Annals of operations research 14 (1988), S. 291-304 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In an earlier paper, the authors formulated an acoustic antenna array design problem as a nonlinear program. Computation times for large problems (about 400 sensors) were in the range of 8 to 10 hours on a Vax 11/780. Most of this time was spent in computing the objective function and its gradient. This paper describes how these computations (and these only) were recoded to exploit the vector processing capabilities of a Cray 1-M computer. Run times are reduced to less than one minute. The results have implications for many nonlinear programs whose function evaluations are very time consuming.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02186484
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Efficient finite difference derivatives for algebraic modelling systems (1992)
    Springer
    Annals of operations research 38 (1992), S. 485-499 
    Details
    ISSN: 1572-9338
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract A procedure is described which determines Jacobian incidence structure and the constant/nonconstant nature of each Jacobian element via examination of the text of function expression strings. This procedure may be used to minimize the effort required to evaluate by finite differences the Jacobian of a set of functions. Target applications involve algebraic modelling systems and other systems with interpreted functions which require evaluation of first derivatives. Computational experience is presented and discussed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02283662
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    Solving geometric programs using GRG: Results and comparisons (1978)
    Springer
    Journal of optimization theory and applications 26 (1978), S. 253-264 
    Details
    ISSN: 1573-2878
    Keywords: Geometric programs ; optimization ; generalized reduced gradient method ; nonlinear programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper describes the performance of a general-purpose GRG code for nonlinear programming in solving geometric programs. The main conclusions drawn from the experiments reported are: (i) GRG competes well with special-purpose geometric programming codes in solving geometric programs; and (ii) standard time, as defined by Colville, is an inadequate means of compensating for different computing environments while comparing optimization algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00933406
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    Derivative evaluation and computational experience with large bilevel mathematical programs (1990)
    Springer
    Journal of optimization theory and applications 65 (1990), S. 485-499 
    Details
    ISSN: 1573-2878
    Keywords: Bilevel programming ; economic planning ; hierarchical decision making ; multilevel programming ; sensitivity analysis ; economic models
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A bilevel program is a mathematical program involving functions defined implicitly as solutions to another mathematical program. We discuss a method for extracting derivative information on the implicit function, which is especially efficient when the lower-level problem has simple bounds on the variables and/or many inactive constraints. Computational experience on problems with up to 230 variables and 30 constraints is presented.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00939562
    Library Location Call Number Volume/Issue/Year 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...