Library

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
  • 65K05  (2)
  • 65D05  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Mathematical programming 56 (1992), S. 337-341 
    ISSN: 1436-4646
    Keywords: 90C25 ; 65K05 ; Lagrange dualization ; existence theorems ; numerical aspects
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this note partially separable convex programs are dualized in such a way that, under certain assumptions, unconstrained concave duals arise. A return formula is given by which the solution of the primal is directly computed if a solution of the dual is known. Further, the solvability of both the primal and the dual is shown to depend essentially on the behaviour of the lower dimensional programs for determining the Fenchel conjugates.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Computing 35 (1985), S. 219-229 
    ISSN: 1436-5057
    Keywords: 65K05 ; 65D07 ; 90C20 ; 41A15 ; Existence conditions ; quadratic programming ; dual optimization problem ; tridiagonal Hessian ; Newton's method
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Das Problem, konvexe Interpolationssplines mit minimaler mittlerer Krümmung zu ermitteln, führt auf eine speziell strukturierte quadratische Optimierungsaufgabe. In der vorliegenden Note wird eine zugehörige duale Aufgabe aufgestellt, die ohne Nebenbedingungen auskommt, deren Zielfunktion stückweise quadratisch ist und die daher eine effektive numerische Behandlung erlaubt.
    Notes: Abstract The problem of finding convex spline interpolants with minimal mean curvature leads to a quadratic optimization problem of special structure. In the present note a corresponding dual problem without constraints is derived. Its objective function is piecewise quadratic and therefore admits an effective numerical treatment.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Computing 53 (1994), S. 137-154 
    ISSN: 1436-5057
    Keywords: 65D05 ; 65D07 ; 41A15 ; Shape preserving interpolation of scattered data ; range restrictions ; Powell-Sabin splines ; minimum norm modification ; thin plate functional
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Description / Table of Contents: Zusammenfassung Behandelt wird die Interpolation unregelmäßig verteilter Daten durch quadratische Powell-Sabin-Splines, wobei stückweise konstante obere und untere Schranken für die Funktionswerte der Interpolierenden vorgegeben sind. Die hergeleiteten hinreichenden Bedingungen für die Einhaltung der zweiseitigen Schranken ergeben ein lösbares lineares Ungleichungssytem für die Gradienten als Parameter, welches bezüglich der Datenpunkte separiert ist. Die Auswahl von visuell gefälligen Interpolierenden erfolgt durch die Minimierung geeigneter Funktionale.
    Notes: Abstract The construction of range restricted bivariateC 1 interpolants to scattered data is considered. In particular, we deal with quadratic spline interpolation on a Powell-Sabin refinement of a triangulation of the data sites subject to piecewise constant lower and upper bounds on the values of the interpolant. The derived sufficient conditions for the fulfillment of the range restrictions result in a solvable system of linear inequalities for the gradients as parameters, which is separated with respect to the data sites. Since there exists an infinite number of spline interpolants meeting the constraints, the selection of a visually pleasant solution is based on the minimum norm modification of a suitable initial interpolant or on the minimization of the thin plate functional. While the first proposal reduces to the solution of independent local quadratic programs, the second proposal results in a global quadratic optimization problem.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...