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
Filter
  • 49 Q 05  (1)
  • Lagrangian relaxation  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Minimal surfaces with prescribed topological type on a Schwarzian chain inM c 3 (1993)
    Springer
    Annals of global analysis and geometry 11 (1993), S. 331-344 
    Details
    ISSN: 1572-9060
    Keywords: Minimal surfaces ; quasi-minimal surfaces ; variational principle ; Schwarzian chain ; 53 A 10 ; 49 Q 05 ; 58 E 12
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Similar to the investigations of unstable polygonal minimal surfaces by Courant [1] we introduce here a variational principle for the free boundary problem with prescribed topological type which produces minimal surfaces in Riemannian manifolds with constant curvature. For special boundary configurations the surfaces have no branch points. The approach can be applied to numerical algorithms since it is constructive.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00773549
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Dual Bounds and Optimality Cuts for All-Quadratic Programs with Convex Constraints (2000)
    Springer
    Journal of global optimization 18 (2000), S. 337-356 
    Details
    ISSN: 1573-2916
    Keywords: Global optimization ; Nonconvex quadratic programming ; Lagrangian relaxation ; Optimality cuts ; Duality gap
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract A central problem of branch-and-bound methods for global optimization is that often a lower bound do not match with the optimal value of the corresponding subproblem even if the diameter of the partition set shrinks to zero. This can lead to a large number of subdivisions preventing the method from terminating in reasonable time. For the all-quadratic optimization problem with convex constraints we present optimality cuts which cut off a given local minimizer from the feasible set. We propose a branch-and-bound algorithm using optimality cuts which is finite if all global minimizers fulfill a certain second order optimality condition. The optimality cuts are based on the formulation of a dual problem where additional redundant constraints are added. This technique is also used for constructing tight lower bounds. Moreover we present for the box-constrained and the standard quadratic programming problem dual bounds which have under certain conditions a zero duality gap.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1023/A:1026596100403
    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...