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
  • Articles  (19)
  • Other Sources
  • CR: 5.14  (11)
  • Nonlinear Programming
  • Springer  (19)
  • 2020-2022
  • 1995-1999
  • 1985-1989  (3)
  • 1980-1984  (16)
  • 1970-1974
  • 1985  (3)
  • 1982  (16)
  • Mathematics  (19)
  • Technology
  • Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
Collection
  • Articles  (19)
  • Other Sources
Source
Keywords
Publisher
  • Springer  (19)
Years
  • 2020-2022
  • 1995-1999
  • 1985-1989  (3)
  • 1980-1984  (16)
  • 1970-1974
Year
Topic
  • Mathematics  (19)
  • Technology
  • Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
  • Computer Science  (8)
  • 1
    Electronic Resource
    Electronic Resource
    On the computational utility of posynomial geometric programming solution methods (1982)
    Springer
    Mathematical programming 22 (1982), S. 163-201 
    Details
    ISSN: 1436-4646
    Keywords: Geometric Programming ; Code Comparisons ; Numerical Testing ; Nonlinear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Ten codes or code variants were used to solve the five equivalent posynomial GP problem formulations. Four of these codes were general NLP codes; six were specialized GP codes. A total of forty-two test problems was solved with up to twenty randomly generated starting points per problem. The convex primal formulation is shown to be intrinsically easiest to solve. The general purpose GRG code called OPT appears to be the most efficient code for GP problem solution. The reputed superiority of the specialized GP codes GGP and GPKTC appears to be largely due to the fact that these codes solve the convex primal formulation. The dual approaches are only likely to be competitive for small degree of difficulty, tightly constrained problems.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581036
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function (1982)
    Springer
    Mathematical programming 23 (1982), S. 75-86 
    Details
    ISSN: 1436-4646
    Keywords: Constrained Optimization ; Global Convergence ; Nonlinear Programming ; Penalty Function ; Quasi-Newton Method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract The recently proposed quasi-Newton method for constrained optimization has very attractive local convergence properties. To force global convergnce of the method, a descent method which uses Zangwill's penalty function and an exact line search has been proposed by Han. In this paper a new method which adopts a differentiable penalty function and an approximate line is presented. The proposed penalty function has the form of the augmented Lagrangian function. An algorithm for updating parameters which appear in the penalty function is described. Global convergence of the given method is proved.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01583780
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Simple bounds for solutions of monotone complementarity problems and convex programs (1985)
    Springer
    Mathematical programming 32 (1985), S. 32-40 
    Details
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Complementarity ; Monotonicity ; Convexity ; Bounds
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract For a solvable monotone complementarity problem we show that each feasible point which is not a solution of the problem provides simple numerical bounds for some or all components of all solution vectors. Consequently for a solvable differentiable convex program each primal-dual feasible point which is not optimal provides simple bounds for some or all components of all primal-dual solution vectors. We also give an existence result and simple bounds for solutions of monotone compementarity problems satisfying a new, distributed constraint qualification. This result carries over to a simple existence and boundedness result for differentiable convex programs satisfying a similar constraint qualification.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585657
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    Electronic Resource
    Electronic Resource
    On uniqueness of Kuhn-Tucker multipliers in nonlinear programming (1985)
    Springer
    Mathematical programming 32 (1985), S. 242-246 
    Details
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Kuhn—Tucker Multipliers ; Constraint Qualifications ; Second Order Conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently Fujiwara, Han and Mangasarian introduced a new constraint qualification which is a slight tightening of the well-known Mangasarian—Fromovitz constraint qualification. We show that this new qualification is a necessary and sufficient condition for the uniqueness of Kuhn—Tucker multipliers. We also show that it implies the satisfaction of second order necessary optimality conditions at a local minimum.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01586095
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 5
    Electronic Resource
    Electronic Resource
    On optimality conditions for structured families of nonlinear programming problems (1982)
    Springer
    Mathematical programming 22 (1982), S. 82-92 
    Details
    ISSN: 1436-4646
    Keywords: Generic Programming ; Optimality Conditions ; Nonlinear Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Optimality conditions for families of nonlinear programming problems inR n are studied from a generic point of view. The objective function and some of the constraints are assumed to depend on a parameter, while others are held fixed. Techniques of differential topology are used to show that under suitable conditions, certain strong second-order conditions are necessary for optimality except possibly for parameter values lying in a negligible set.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01581027
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 6
    Electronic Resource
    Electronic Resource
    Nonlinear programming via an exact penalty function: Global analysis (1982)
    Springer
    Mathematical programming 24 (1982), S. 137-161 
    Details
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Exact Penalty Methods ; Successive Quadratic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we motivate and describe an algorithm to solve the nonlinear programming problem. The method is based on an exact penalty function and possesses both global and superlinear convergence properties. We establish the global qualities here (the superlinear nature is proven in [7]). The numerical implementation techniques are briefly discussed and preliminary numerical results are given.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585101
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 7
    Electronic Resource
    Electronic Resource
    Fast Givens rotations for orthogonal similarity transformations (1982)
    Springer
    Numerische Mathematik 40 (1982), S. 47-56 
    Details
    ISSN: 0945-3245
    Keywords: AMS (MOS): 65F30 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Fast Givens rotations with half as many multiplications are proposed for orthogonal similarity transformations and a matrix notation is introduced to describe them more easily. Applications are proposed and numerical results are examined for the Jacobi method, the reduction to Hessenberg form and the QR-algorithm for Hessenberg matrices. It can be seen that in general fast Givens rotations are competitive with Householder reflexions and offer distinct advantages for sparse matrices.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01459074
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 8
    Electronic Resource
    Electronic Resource
    Exact solution of linear equations usingP-adic expansions (1982)
    Springer
    Numerische Mathematik 40 (1982), S. 137-141 
    Details
    ISSN: 0945-3245
    Keywords: (MR 1980) AMS(MOS) ; 65F05, 15A06, 10M10, 10A30 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A method is described for computing the exact rational solution to a regular systemAx=b of linear equations with integer coefficients. The method involves: (i) computing the inverse (modp) ofA for some primep; (ii) using successive refinements to compute an integer vector $$\bar x$$ such that $$A\bar x \equiv b$$ (modp m ) for a suitably large integerm; and (iii) deducing the rational solutionx from thep-adic approximation $$\bar x$$ . For matricesA andb with entries of bounded size and dimensionsn×n andn×1, this method can be implemented in timeO(n 3(logn)2) which is better than methods previously used.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01459082
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 9
    Electronic Resource
    Electronic Resource
    Error bounds for computed eigenvalues and eigenvectors. II (1982)
    Springer
    Numerische Mathematik 40 (1982), S. 201-206 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F05, 65F15, 65H10 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper, motivated by Symm-Wilkinson's paper [5], we describe a method which finds the rigorous error bounds for a computed eigenvalue λ(0) and a computed eigenvectorx (0) of any matrix A. The assumption in a previous paper [6] that λ(0),x (0) andA are real is not necessary in this paper. In connection with this method, Symm-Wilkinson's procedure is discussed, too.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01400539
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 10
    Electronic Resource
    Electronic Resource
    Nonlinear programming via an exact penalty function: Asymptotic analysis (1982)
    Springer
    Mathematical programming 24 (1982), S. 123-136 
    Details
    ISSN: 1436-4646
    Keywords: Nonlinear Programming ; Exact Penalty Methods ; Successive Quadratic Programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we consider the final stage of a ‘global’ method to solve the nonlinear programming problem. We prove 2-step superlinear convergence. In the process of analyzing this asymptotic behavior, we compare our method (theoretically) to the popular successive quadratic programming approach.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01585100
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 11
    Electronic Resource
    Electronic Resource
    Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs (1985)
    Springer
    Mathematical programming 33 (1985), S. 280-299 
    Details
    ISSN: 1436-4646
    Keywords: Marginal Function ; Optimal Value ; Nonlinear Programming ; Sensitivity Analysis ; Parametric Programming ; Asymptotic Distribution
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper we study second-order differential properties of an optimal-value functionϕ(x). It is shown that under certain conditionsϕ(x) possesses second-order directional derivatives, which can be calculated by solving corresponding quadratic programs. Also upper and lower bounds on these derivatives are introduced under weaker assumptions. In particular we show that the second-order directional derivative is infinite if the corresponding quadratic program is unbounded. Finally sensitivity results are applied to investigate asymptotics of estimators in parametrized nonlinear programs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01584378
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 12
    Electronic Resource
    Electronic Resource
    LU decompositions of generalized diagonally dominant matrices (1982)
    Springer
    Numerische Mathematik 40 (1982), S. 57-69 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F05 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Using the simple vehicle ofM-matrices, the existence and stability ofLU decompositions of matricesA which can be scaled to diagonally dominant (possibly singular) matrices are investigated. Bounds on the growth factor for Gaussian elimination onA are derived. Motivation for this study is provided in part by applications to solving homogeneous systems of linear equationsAx=0, arising in Markov queuing networks, input-output models in economics and compartmental systems, whereA or −A is an irreducible, singularM-matrix. This paper extends earlier work by Funderlic and Plemmons and by Varga and Cai.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01459075
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 13
    Electronic Resource
    Electronic Resource
    Computing theCS decomposition of a partitioned orthonormal matrix (1982)
    Springer
    Numerische Mathematik 40 (1982), S. 297-306 
    Details
    ISSN: 0945-3245
    Keywords: AMS (MOS): 65F25 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary This paper describes an algorithm for simultaneously diagonalizing by orthogonal transformations the blocks of a partitioned matrix having orthonormal columns.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01396447
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 14
    Electronic Resource
    Electronic Resource
    On fixed point linear equations (1982)
    Springer
    Numerische Mathematik 38 (1982), S. 53-59 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10 ; 47B55 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary By means of successive partial substitutions it is possible to obtain new fixed point linear equations from old ones and it is interesting to determine how the spectral radius of the corresponding matrices varies. We prove that, when the original matrix is nonnegative, this variation is decreasing or increasing, depending on whether the original matrix has its spectral radius smaller or greater than 1. We answer in this way a question posed by F. Robert in [5].
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01395808
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 15
    Electronic Resource
    Electronic Resource
    A modified bisection algorithm for the determination of the eigenvalues of a symmetric tridiagonal matrix (1982)
    Springer
    Numerische Mathematik 38 (1982), S. 417-419 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary A modification to the well known bisection algorithm [1] when used to determine the eigenvalues of a real symmetric matrix is presented. In the new strategy the terms in the Sturm sequence are computed only as long as relevant information on the required eigenvalues is obtained. The resulting algorithm usingincomplete Sturm sequences can be shown to minimise the computational work required especially when only a few eigenvalues are required. The technique is also applicable to other computational methods which use the bisection process.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01396441
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 16
    Electronic Resource
    Electronic Resource
    A contribution to the theory of condition (1982)
    Springer
    Numerische Mathematik 39 (1982), S. 85-96 
    Details
    ISSN: 0945-3245
    Keywords: AMS65F05 ; 65F 15 ; 65F 20 ; 65F 35 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary In this paper the use of the condition number of a problem, as defined by Rice in 1966, is discussed. For the eigenvalue, eigenvector, and linear least squares problems either condition numbers according to various norms are determined or lower and upper bounds for them are derived.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01399313
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 17
    Electronic Resource
    Electronic Resource
    Inversion of tridiagonal matrices (1982)
    Springer
    Numerische Mathematik 38 (1982), S. 333-345 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 15 A 09, 15-04 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary This paper presents a simple algorithm for inverting nonsymmetric tridiagonal matrices that leads immediately to closed forms when they exist. Ukita's theorem is extended to characterize the class of matrices that have tridiagonal inverses.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01396436
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 18
    Electronic Resource
    Electronic Resource
    On the convergence of the symmetric SOR method for matrices with red-black ordering (1982)
    Springer
    Numerische Mathematik 39 (1982), S. 113-117 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary We prove that if the matrixA has the structure which results from the so-called “red-black” ordering and ifA is anH-matrix then the symmetric SOR method (called the SSOR method) is convergent for 0〈ω〈2. In the special case thatA is even anM-matrix we show that the symmetric single-step method cannot be accelerated by the SSOR method. Symmetry of the matrixA is not assumed.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01399315
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 19
    Electronic Resource
    Electronic Resource
    Zur Konvergenz eines Verfahrens von D.J. Evans zur iterativen Verbesserung einer Näherung für die inverse Matrix (1982)
    Springer
    Numerische Mathematik 39 (1982), S. 163-173 
    Details
    ISSN: 0945-3245
    Keywords: AMS(MOS): 65F10 ; CR: 5.14
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Summary Recently D.J. Evans introduced an implicit matrix inversion process showing asymptotic behaviour which is superior to that of the well known Schulz-method. In this paper we give sufficient conditions for convergence, prove some error bounds and show that under certain conditions the iterates are converging monotonously.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01408691
    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...