ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (33)
  • duality  (33)
  • Springer  (33)
  • American Chemical Society
  • Blackwell Publishing Ltd
  • Emerald
  • 1995-1999  (33)
  • Mathematik  (33)
Sammlung
  • Artikel  (33)
Verlag/Herausgeber
  • Springer  (33)
  • American Chemical Society
  • Blackwell Publishing Ltd
  • Emerald
  • Wiley-Blackwell  (1)
Erscheinungszeitraum
Jahr
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    OR spectrum 18 (1996), S. 209-217 
    ISSN: 1436-6304
    Schlagwort(e): Semi-infinite programming ; duality ; Semi-infinite Programmierung ; Dualität
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Wirtschaftswissenschaften
    Beschreibung / Inhaltsverzeichnis: Zusammenfassung Diese Arbeit unterstreicht die Anwendbarkeit des sogenannten Dualproblems von Haar in linearer semi-infiniter Optimierung und analysiert seine Eigenschaften. Dies geschieht im Hinblick auf eine Reduktion in ein gewöhnliches lineares Optimierungsproblem, eine sequentielle Approximation durch endliche Teilprobleme und auch zum Finden einer numerischen Lösung durch Verfahren der zulässigen Richtungen.
    Notizen: Abstract This paper emphasizes the great potential applicability of the so-called Haar's dual problem, in linear semi-infinite programming, and analyzes its properties in order to its reduction to an ordinary linear program, its sequential approximation through finite subprograms, as well as to its numerical solution by feasible directions strategies.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Studia logica 56 (1996), S. 97-110 
    ISSN: 1572-8730
    Schlagwort(e): demi-p-lattice ; almost-p-lattice ; free algebra ; duality ; poset
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Philosophie
    Notizen: Abstract Finite demi-p-lattices are described in terms of the poset of its join irreducible elements endowed with a suitable set of maps. Description of the free algebras of demi-p-lattices and almost-p-lattices with n free generators are given.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Studia logica 56 (1996), S. 185-204 
    ISSN: 1572-8730
    Schlagwort(e): duality ; Priestley spaces ; lattice-ordered groups ; implicative lattices
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Philosophie
    Notizen: Abstract A topological duality is presented for a wide class of lattice-ordered structures including lattice-ordered groups. In this new approach, which simplifies considerably previous results of the author, the dual space is obtained by endowing the Priestley space of the underlying lattice with two binary functions, linked by set-theoretical complement and acting as symmetrical partners. In the particular case of l-groups, one of these functions is the usual product of sets and the axiomatization of the dual space is given by very simple first-order sentences, saying essentially that both functions are associative and that the space is a residuated semigroup with respect to each of them.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Digitale Medien
    Digitale Medien
    Springer
    Order 15 (1998), S. 297-323 
    ISSN: 1572-9273
    Schlagwort(e): duality ; implicative lattice ; lattice-ordered group ; Priestley space
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract The laws defining many important varieties of lattice-ordered algebras, such as linear Heyting algebras, MV-algebras and l-groups, can be cast in a form which allows dual representations to be derived in a very direct, and semi-automatic, way. This is achieved by developing a new duality theory for implicative lattices, which encompass all the varieries above. The approach focuses on distinguished subsets of the prime lattice filters of an implicative lattice, ordered as usual by inclusion. A decomposition theorem is proved, and the extent to which the order on the prime lattice filters determines the implicative structure is thereby revealed.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Digitale Medien
    Digitale Medien
    Springer
    Journal of algebraic combinatorics 6 (1997), S. 203-228 
    ISSN: 1572-9192
    Schlagwort(e): spin model ; association scheme ; duality ; modular invariance ; Abelian group
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A spin model is a triple (X, W +, W −), where W + and W − are complex matrices with rows and columns indexed by X which satisfy certain equations (these equations allow the construction of a link invariant from(X, W +, W −) ). We show that these equations imply the existence of a certain isomorphism Ψ between two algebras $$\mathfrak{M}$$ and $$\mathfrak{H}$$ associated with (X, W +, W −) . When $$\mathfrak{M} = \mathfrak{H} = \mathfrak{A},\mathfrak{A}$$ is the Bose-Mesner algebra of some association scheme, and Ψ is a duality of $$\mathfrak{A}$$ . These results had already been obtained in [15] when W +, W − are symmetric, and in [5] in the general case, but the present proof is simpler and directly leads to a clear reformulation of the modular invariance property for self-dual association schemes. This reformulation establishes a correspondence between the modular invariance property and the existence of “spin models at the algebraic level”. Moreover, for Abelian group schemes, spin models at the algebraic level and actual spin models coincide. We solve explicitly the modular invariance equations in this case, obtaining generalizations of the spin models of Bannai and Bannai [3]. We show that these spin models can be identified with those constructed by Kac and Wakimoto [20] using even rational lattices. Finally we give some examples of spin models at the algebraic level which are not actual spin models.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Digitale Medien
    Digitale Medien
    Springer
    Journal of theoretical probability 12 (1999), S. 271-292 
    ISSN: 1572-9230
    Schlagwort(e): Capacity ; quasi-continuous ; symmetric process ; duality ; hitting probability
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Let X and $$\hat X$$ be transient standard Markov processes in weak duality with respect to a σ-finite measure m. Let (Y, Ŷ, μ) be a second “dual pair” with the same state space E as (X, $$\hat X$$ , m). Let Cap X and Cap Y be the 0-order capacities associated with (X, $$\hat X$$ , m) and (Y, Ŷ, μ), and let V and $$\hat V$$ denote the potential kernels for Y and Ŷ. Assume that singletons are polar with respect to both X and Y, and that semipolar sets are of capacity zero for both dual pairs. We show that if Cap X (B)=Cap Y (B) for every Borel subset of E then there is a strictly increasing continuous additive functional D=(D t) t≥0 of (X, $$\hat X$$ , m) such that $$U_D (x,dy) + \hat U_D (x,dy) = V(x,dy) + \hat V(x,dy)$$ with the exception of a capacity-zero set of x's. Here U D (resp. Û D) is the potential kernel of the time-changed process $$X_{D^{ - 1} (t)}$$ (resp. $$\hat X_{D^{ - 1} (t)} )$$ , t≥0. In particular, if both X and Y are symmetric processes, then the equality of the capacities Cap X and Cap Y implies that X and Y are time changes of one another. This derivation rests on a generalization of a formula of Choquet concerning the “differentiation” of capacities. In the symmetric case, our main result extends a theorem of Glover et al.(23)
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Digitale Medien
    Digitale Medien
    Springer
    Potential analysis 4 (1995), S. 595-613 
    ISSN: 1572-929X
    Schlagwort(e): 31D05 ; Balayage space ; duality ; measure representation ; Dirichlet integral
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract We discuss the duality (mutual adjointness) of two balayage-space structures ℌ and $$\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{\mathfrak{H}} $$ on a locally compact spaceX via measure representations σ for ℌ and ĝs for $$\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{\mathfrak{H}} $$ . Then we show that some properties of the Dirichlet integral δ f (X) of functionsf onX, which have been shown for harmonic spaces having an adjoint harmonic structure, still hold for a balayage space having an adjoint balayage-space structure. In particular, we obtain the relations 0≤δ f (X)+1/2∫f 2 dσ(1)≤∫fdσ(f)〈∞ forf=p 1−p 2 with bounded continuous potentialsp j such that ∫pjdσ(p j)〈∞,j=1,2.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Digitale Medien
    Digitale Medien
    Springer
    Journal of theoretical probability 10 (1997), S. 349-374 
    ISSN: 1572-9230
    Schlagwort(e): Birth and death chain ; random walk ; duality ; continued fraction ; canonical moments
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract For a birth and death chain on the nonnegative integers with birth and death probabilities p i and q i≡ 1 –p i and reflecting barrier at 0, it is shown that the right tails of the probability of the first return from state 0 to state 0 are simple transition probabilities of a dual birth and death chain obtained by switching p iand q i. Combinatorial and analytical proofs are presented. Extensions and relations to other concepts of duality in the literature are discussed.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Digitale Medien
    Digitale Medien
    Springer
    Annals of the Institute of Statistical Mathematics 47 (1995), S. 155-165 
    ISSN: 1572-9052
    Schlagwort(e): Bias ; convex cone ; covariance matrix ; duality ; linear regression ; minimax test ; union-intersection principle
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Let (P ϑ : ϑ εR p ) be a simple shift family of distributions onR p , and letK ⊂R p be a convex cone. Within the class of nonrandomized tests ofK versusR p ∖K, whose acceptance regionA satisfiesA=A+K, a test with minimal bias is constructed. This minimax test is compared to a likelihood ratio type test, which is optimal with respect to a different criterion. The minimax test is mimicked in the context of linear regression and one-sided tests for covariance matrices.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Digitale Medien
    Digitale Medien
    Springer
    Compositio mathematica 110 (1998), S. 127-162 
    ISSN: 1570-5846
    Schlagwort(e): algebraic cocycles ; algebraic cycles ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract This paper extends to quasi-projective varieties earlier work by the author and H. Blaine Lawson concerning spaces of algebraic cocycles on projective varieties. The topological monoid Cr(Y) (U) of effective cocycles on a normal, quasi-projective variety U with values in a projective variety Y consists of algebraic cycles on U×Y equi-dimensional of relative dimension r over U. A careful choice of topology enables the establishment of various good properties: the definition is essentially algebraic, the group completion Zr (Y) (U) has 'sensible' homotopy groups, the construction is contravariant with respect to U, convariant with respect to Y, and there is a natural 'quality map" to the topological group of cycles on U×Y. The fundamental theorem presented here is the extension of Friedlander-Lawson duality to this context: the duality map Zr (Y) (U) to Z_r+m (U × Y) is a homotopy equivalence provided that both U and Y are smooth (where m=dim U). Various application are given, especially the determination of the homotopy types of certain topological groups of algeb raic morphisms.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 11
    Digitale Medien
    Digitale Medien
    Springer
    Studia logica 56 (1996), S. 151-183 
    ISSN: 1572-8730
    Schlagwort(e): Semi-DeMorgan algebra ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Philosophie
    Notizen: Abstract Semi-DeMorgan algebras are a common generalization of DeMorgan algebras and pseudocomplemented distributive lattices. A duality for them is developed that builds on the Priestley duality for distributive lattices. This duality is then used in several applications. The subdirectly irreducible semi-DeMorgan algebras are characterized. A theory of “partial diagrams” is developed, where properties of algebras are tied to the omission of certain partial diagrams from their duals. This theory is then used to find and give axioms for the largest variety of semi-DeMorgan algebras with the congruence extension property.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 12
    Digitale Medien
    Digitale Medien
    Springer
    K-Theory 17 (1999), S. 319-362 
    ISSN: 1573-0514
    Schlagwort(e): Mathematics Subject Classifications (1991): 19D55, 57R32, 22A22. ; Cyclic cohomology ; groupoids ; crossed products ; duality ; foliations.
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract We give a general method for computing the cyclic cohomology of crossed products by étale groupoids, extending the Feigin–Tsygan–Nistor spectral sequences. In particular we extend the computations performed by Brylinski, Burghelea, Connes, Feigin, Karoubi, Nistor, and Tsygan for the convolution algebra C c ∞ (G) of an étale groupoid, removing the Hausdorffness condition and including the computation of hyperbolic components. Examples like group actions on manifolds and foliations are considered.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 13
    Digitale Medien
    Digitale Medien
    Springer
    Letters in mathematical physics 48 (1999), S. 73-84 
    ISSN: 1573-0530
    Schlagwort(e): unified theory ; superstrings ; supersymmetry ; duality ; M-theory ; holography ; conformal ; De Sitter
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Physik
    Notizen: Abstract We give a historical review of some aspects of string theory relevant to our present understanding of General Relativity, and connected with Einstein's unification program. We also point out to various mathematical fallouts of string theory.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 14
    Digitale Medien
    Digitale Medien
    Springer
    Letters in mathematical physics 50 (1999), S. 309-321 
    ISSN: 1573-0530
    Schlagwort(e): noncommutative geometry ; supergeometry ; Yang–Mills theory ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik , Physik
    Notizen: Abstract We introduce a notion of Q-algebra that can be considered as a generalization of the notion of Q-manifold (a supermanifold equipped with an odd vector field obeying {Q,Q} =0). We develop the theory of connections on modules over Q-algebras and prove a general duality theorem for gauge theories on such modules. This theorem contains as a simplest case SO(d,d, Z)-duality of gauge theories on noncommutative tori.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 15
    Digitale Medien
    Digitale Medien
    Springer
    Numerical algorithms 22 (1999), S. 113-128 
    ISSN: 1572-9265
    Schlagwort(e): linear equations ; conjugate gradients ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Informatik , Mathematik
    Notizen: Abstract In this paper we show that if the step (displacement) vectors generated by the preconditioned conjugate gradient algorithm are scaled appropriately they may be used to solve equations whose coefficient matrices are the preconditioning matrices of the original equations. The dual algorithms thus obtained are shown to be equivalent to the reverse algorithms of Hegedüs and are subsequently generalised to their block forms. It is finally shown how these may be used to construct dual (or reverse) algorithms for solving equations involving nonsymmetric matrices using only short recurrences, and reasons are suggested why some of these algorithms may be more numerically stable than their primal counterparts.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 16
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 86 (1995), S. 491-500 
    ISSN: 1573-2878
    Schlagwort(e): Generalized convexity ; duality ; fractional programming ; multiobjective programming ; minmax programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Hanson and Mond have given sets of necessary and sufficient conditions for optimality and duality in constrained optimization by introducing classes of generalized convex functions, called type I and type II functions. Recently, Bector defined univex functions, a new class of functions that unifies several concepts of generalized convexity. In this paper, optimality and duality results for several mathematical programs are obtained combining the concepts of type I and univex functions. Examples of functions satisfying these conditions are given.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 17
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 94 (1997), S. 561-590 
    ISSN: 1573-2878
    Schlagwort(e): Theorems of the alternative ; duality ; minimum norm duality theorem ; steepest descent directions ; least norm problems ; alignment ; constructive optimality conditions ; degeneracy
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract This paper investigates the relations between theorems of the alternative and the minimum norm duality theorem. A typical theorem of the alternative is associated with two systems of linear inequalities and/or equalities, a primal system and a dual one, asserting that either the primal system has a solution, or the dual system has a solution, but never both. On the other hand, the minimum norm duality theorem says that the minimum distance from a given point z to a convex set $$\mathbb{K}$$ is equal to the maximum of the distances from z to the hyperplanes separating z and $$\mathbb{K}$$ . We consider the theorems of Farkas, Gale, Gordan, and Motzkin, as well as new theorems that characterize the optimality conditions of discrete l 1-approximation problems and multifacility location problems. It is shown that, with proper choices of $$\mathbb{K}$$ , each of these theorems can be recast as a pair of dual problems: a primal steepest descent problem that resembles the original primal system, and a dual least–norm problem that resembles the original dual system. The norm that defines the least-norm problem is the dual norm with respect to that which defines the steepest descent problem. Moreover, let y solve the least norm problem and let r denote the corresponding residual vector. If r=0, which means that z ∈ $$\mathbb{K}$$ , then y solves the dual system. Otherwise, when r≠0 and z ∉ $$\mathbb{K}$$ , any dual vector of r solves both the steepest descent problem and the primal system. In other words, let x solve the steepest descent problem; then, r and x are aligned. These results hold for any norm on $$\mathbb{R}^n $$ . If the norm is smooth and strictly convex, then there are explicit rules for retrieving x from r and vice versa.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 18
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 98 (1998), S. 365-384 
    ISSN: 1573-2878
    Schlagwort(e): Generalized cone-subconvexlikeness ; vector optimization ; proper efficiency ; scalarization ; Lagrangian multipliers ; saddle-point criterion ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Under generalized cone-subconvexlikeness for vector-valued mappings in locally-convex Hausdorff topological vector spaces, a Gordan-form alternative theorem is derived. Some characterizations of the Benson proper efficiency under this generalized convexity are established in terms of scalarization, Lagrangian multipliers, saddle-point criterion, and duality.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 19
    Digitale Medien
    Digitale Medien
    Springer
    Journal of combinatorial optimization 1 (1998), S. 367-376 
    ISSN: 1573-2886
    Schlagwort(e): job scheduling problem ; drug market crackdown scheduling problem ; duality ; polynomial time algorithm ; quasipolynomial time approximation algorithm
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract We give polynomial time algorithms for a job scheduling problem. By duality we transform a special case of the drug market crackdown schedulingproblem to the above job scheduling problem and thus derive polynomial timealgorithms to the second problem. Finally, using the algorithm for the specialcase, we develop a quasipolynomial time approximation algorithm for thegeneral case of the drug market crackdown scheduling problem with monomialcost functions.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 20
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 85 (1995), S. 489-494 
    ISSN: 1573-2878
    Schlagwort(e): Convex programs ; barrier functions ; duality ; approximations
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Recently, Fang proposed approximating a linear program in Karmarkar's standard form by adding an entropic barrier function to the objective function and using a certain geometric inequality to transform the resulting problem into an unconstrained differentiable concave program. We show that, by using standard duality theory for convex programming, the results of Fang and his coworkers can be strengthened and extended to linearly constrained convex programs and more general barrier functions.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 21
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 86 (1995), S. 745-752 
    ISSN: 1573-2878
    Schlagwort(e): Convex programs ; linear programs ; perturbations ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Recently, Fang proposed approximating a linear program in the Karmarkar standard form by adding an entropic barrier function to the objective function and derived an unconstrained dual concave program. We present in this note a necessary and sufficient condition for the existence of a dual optimal solution to the perturbed problem. In addition, a sharp upper bound of error estimation in this approximation scheme is provided.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 22
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 86 (1995), S. 719-743 
    ISSN: 1573-2878
    Schlagwort(e): Quasiconvex functions ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A complicated factor in quasiconvex duality is the appearance of extra parameters. In order to avoid these extra parameters, one often has to restrict the class of quasiconvex functions. In this paper, by using the Diewert-Crouzeix conjugation, we present a duality without an extra parameter for general quasiconvex minimization problem. As an application, we prove a decentralization by prices for the Von Neumann equilibrium problem.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 23
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 88 (1996), S. 689-707 
    ISSN: 1573-2878
    Schlagwort(e): Pareto-optimal solutions ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract LetX * be the set of Pareto-optimal solutions of a multicriteria programming problem. We are interested in finding a vectorxεX * which minimizes another criterion. SinceX * is a nonconvex set, our problem is that of minimization over a nonconvex set. By exploiting the fact that the number of criteria is often very small compared with the number of variables, we use a dual approach to obtain a practical algorithm. We report preliminary numerical results on problems with up to 100 variables and 5 criteria.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 24
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 88 (1996), S. 709-724 
    ISSN: 1573-2878
    Schlagwort(e): Multipliers ; penalty functions ; duality ; nonsmooth optimization ; stochastic subgradients ; convergence
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract This paper presents a stochastic algorithm with proper stopping rules for nonsmooth inequality-constrained minimization problems. The algorithm is based on an augmented Lagrangian dual problem transformed from a primal one, and it consists of two loops: an outer loop, which is the iteration for the approximate Lagrange multipliers, and an inner loop, which is a nonsmooth unconstrained minimization subroutine. Under mild assumptions, the algorithm is proved to be almost surely convergent.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 25
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 99 (1998), S. 201-234 
    ISSN: 1573-2878
    Schlagwort(e): Stokes systems ; inverse problems ; approximate controllability ; duality ; computational methods
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract We study the approximate controllability of a stationary Stokes system with linearized convection in a bounded domain of ℝN. The control acts on a part of the boundary and the velocity field is observed on an interior curve (N=2) or surface (N=3). We establish the L 2-approximate controllability under certain compatibility conditions and suitable geometrical assumptions on the curve or surface. We build controls of minimal L 2-norm by duality. To compute the control, we propose a numerical method, based on duality techniques, consisting in the minimization of a nonquadratic functional coupled to a Stokes system. It is tested in several situations leading to interesting numerical results.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 26
    Digitale Medien
    Digitale Medien
    Springer
    Journal of global optimization 8 (1996), S. 139-170 
    ISSN: 1573-2916
    Schlagwort(e): Generalized fractional programming ; Dinkelbach-type algorithm ; quasiconvexity ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract In this paper we explore the relations between the standard dual problem of a convex generalized fractional programming problem and the “partial” dual problem proposed by Barros et al. (1994). Taking into account the similarities between these dual problems and using basic duality results we propose a new algorithm to directly solve the standard dual of a convex generalized fractional programming problem, and hence the original primal problem, if strong duality holds. This new algorithm works in a similar way as the algorithm proposed in Barros et al. (1994) to solve the “partial” dual problem. Although the convergence rates of both algorithms are similar, the new algorithm requires slightly more restrictive assumptions to ensure a superlinear convergence rate. An important characteristic of the new algorithm is that it extends to the nonlinear case the Dinkelbach-type algorithm of Crouzeix et al. (1985) applied to the standard dual problem of a generalized linear fractional program. Moreover, the general duality results derived for the nonlinear case, yield an alternative way to derive the standard dual of a generalized linear fractional program. The numerical results, in case of quadratic-linear ratios and linear constraints, show that solving the standard dual via the new algorithm is in most cases more efficient than applying directly the Dinkelbach-type algorithm to the original generalized fractional programming problem. However, the numerical results also indicate that solving the alternative dual (Barros et al., 1994) is in general more efficient than solving the standard dual.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 27
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 101 (1999), S. 109-125 
    ISSN: 1573-2878
    Schlagwort(e): Generalized fractional programming ; cone of directions ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Using a parametric approach, we establish the necessary and sufficient conditions for generalized fractional programming without the need of a constraint qualification. Subsequently, these optimality criteria are utilized as a basis for constructing a parametric dual model and two other parameter-free dual models. Several duality theorems are established.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 28
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 98 (1998), S. 351-364 
    ISSN: 1573-2878
    Schlagwort(e): Directional distance functions ; Nerlovian efficiency ; duality ; profit functions
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract The directional technology distance function is introduced, given an interpretation as a min-max, and compared with other functional representations of the technology including the Shephard input and output distance functions and the McFadden gauge function. A dual correspondence is developed between the directional technology distance function and the profit function, and it is shown that all previous dual correspondences are special cases of this correspondence. We then show how Nerlovian (profit-based) efficiency measures can be computed using the directional technology distance function.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 29
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 101 (1999), S. 15-33 
    ISSN: 1573-2878
    Schlagwort(e): Technical efficiency ; production microeconomics ; metric distance function ; profit function ; shortage function ; efficiency measure ; duality
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract In this paper, we intend to establish relations between the way efficiency is measured in the literature on efficiency analysis and the notion of distance in topology. To this effect, we are interested particularly in the Hölder norm concept, providing a duality result based upon the profit function. Along this line, we prove that the Luenberger shortage function and the directional distance function of Chambers, Chung, and Färe appear as special cases of some l p distance (also called Hölder distance), under the assumption that the production set is convex. Under a weaker assumption (convexity of the input correspondence), we derive a duality result based on the cost function, providing several examples in which the functional form of the production set is specified.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 30
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 85 (1995), S. 309-324 
    ISSN: 1573-2878
    Schlagwort(e): Nonconvex optimization ; nonlinear programming ; saddle points ; duality ; primal-dual methods
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract By an equivalent transformation using thepth power of the objective function and the constraint, a saddle point can be generated for a general class of nonconvex optimization problems. Zero duality gap is thus guaranteed when the primal-dual method is applied to the constructed equivalent form.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 31
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 88 (1996), S. 237-245 
    ISSN: 1573-2878
    Schlagwort(e): Multiobjective optimization ; duality ; preferences ; decisionmakers
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A duality theory for convex multiobjective decisionmaking is developed. This duality theory is designed for a decisionmaker determining preferred solutions, while duality theories presented earlier have focused on how to generate the whole Pareto optimal set.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 32
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 93 (1997), S. 167-182 
    ISSN: 1573-2878
    Schlagwort(e): Nearly convexlike functions ; * quasiconvex functions ; multifunctions ; duality ; vector optimization
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract Two alternative type theorems for nearly convexlike or * quasiconvex multifunctions are presented. They are used to derive Lagrangian conditions and duality results for vector optimization problems when the objectives and the constraints are nearly convexlike or * quasiconvex multifunctions.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 33
    Digitale Medien
    Digitale Medien
    Springer
    Journal of optimization theory and applications 95 (1997), S. 717-722 
    ISSN: 1573-2878
    Schlagwort(e): Quasiconvex functions ; duality ; generalized conjugation
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A function defined on a locally convex space is called evenly quasiconvex if its level sets are intersections of families of open half-spaces. Furthermore, if the closures of these open halfspaces do not contain the origin, then the function is called R-evenly quasiconvex. In this note, R-evenly quasiconvex functions are characterized as those evenly-quasiconvex functions that satisfy a certain simple relation with their lower semicontinuous hulls.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...