ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

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
    Publication Date: 1999-06-01
    Print ISSN: 0022-3239
    Electronic ISSN: 1573-2878
    Topics: Mathematics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Publication Date: 1997-05-01
    Print ISSN: 0022-3239
    Electronic ISSN: 1573-2878
    Topics: Mathematics
    Published by Springer
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 93 (1997), S. 321-336 
    ISSN: 1573-2878
    Keywords: Disjunctive optimization ; stationary points ; stationary index ; deformations ; Morse theory
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we introduce the concepts of (nondegenerate) stationary points and stationary index for disjunctive optimization problems. Two basic theorems from Morse theory, which imply the validity of the (standard) Morse relations, are proved. The first one is a deformation theorem which applies outside the stationary point set. The second one is a cell-attachment theorem which applies at nondegenerate stationary points. The dimension of the cell to be attached equals the stationary index. Here, the stationary index depends on both the restricted Hessian of the Lagrangian and the set of active inequality constraints. In standard optimization problems, the latter contribution vanishes.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical methods of operations research 41 (1995), S. 127-152 
    ISSN: 1432-5217
    Keywords: Nonlinear optimization ; Lagrange multiplier methods ; pathfollowing methods ; singularities
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract This paper deals with Lagrange multiplier methods which are interpreted as pathfollowing methods. We investigate how successful these methods can be for solving “really nonconvex” problems. Singularity theory developed by Jongen-Jonker-Twilt will be used as a successful tool for providing an answer to this question. Certain modifications of the original Lagrange multiplier method extend the possibilities for solving nonlinear optimization problems, but in the worst case we have to find all connected components in the set of all generalized critical points. That is still an open problem. This paper is a continuation of our research with respect to penalty methods (part I) and exact penalty methods (part II).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 101 (1999), S. 677-691 
    ISSN: 1573-2878
    Keywords: Generalized semi-infinite programming ; necessary and sufficient first-order optimality condition ; optimal value function ; directional differentiability ; quasidifferentiability
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we consider a generalized semi-infinite optimization problem where the index set of the corresponding inequality constraints depends on the decision variables and the involved functions are assumed to be continuously differentiable. We derive first-order necessary optimality conditions for such problems by using bounds for the upper and lower directional derivatives of the corresponding optimal value function. In the case where the optimal value function is directly differentiable, we present first-order conditions based on the linearization of the given problem. Finally, we investigate necessary and sufficient first-order conditions by using the calculus of quasidifferentiable functions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 14 (1999), S. 181-204 
    ISSN: 1573-2916
    Keywords: Bifurcation point ; feasible set ; Mangasarian-Fromovitz constraint qualification ; para-metric ; family ; semi-infinite optimization
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Feasible sets in semi-infinite optimization are basically defined by means of infinitely many inequality constraints. We consider one-parameter families of such sets. In particular, all defin-ing functions - including those defining the index set of the inequality constraints - will depend on a parameter. We note that a semi-infinite problem is a two-level problem in the sense that a point is feasible if and only if all global minimizers of a corresponding marginal function are nonnegative. For a quite natural class of mappings we characterize changes in the global topological structure of the corresponding feasible set as the parameter varies. As long as the index set (-mapping) of the inequality constraints is lower semicontinuous, all changes in topology are those which generically appear in one-parameter sets defined by finitely many constraints. In the case, however, that some component of the mentioned index set is born (or vanishes), the topological change is of global nature and is not controllable. In fact, the change might be as drastic as that when adding or deleting an (arbitrary) inequality constraint.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...