摘要:

We propose a local linearization of convex programs, and a corresponding duality theory, which retains the properties of classical duality without assuming constraint qualification.

ISSN:0323-3898    

DOI:10.1080/02331937908842560

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

We describe the extension of quadratic programming algorithms to problems in which some of linear restrictions are given only implicitly.

ISSN:0323-3898    

DOI:10.1080/02331937908842561

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

Considering the convex optimization problem min {f(x)∣,gi(x)≦0,i=1, …,n} we call a smooth convex functionGa convex smoothing, if{x∣G(x)≦0} includes the feasible set, and if the resulting problem min{f(x) ∣G(x≦0)} is equivalent to the initial problem. A relation is developed to the Lagrangian functions: with the involved multiplier functions we are able to define such convex smoothings in some cases.

ISSN:0323-3898    

DOI:10.1080/02331937908842562

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

K.Jänich: Einfüng in die Funktionentheorie. Springer-Verlag, Berlin-Heidelberg-New York 1977, IX, 239 S., DM 19.80.

ISSN:0323-3898    

DOI:10.1080/02331937908842563

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

Iffis a real-valued function which is upper semicontinuous on a compact subset of a topological space, then it attains a maximal value. There are similar results for partial-order-valued functions. This paper assumesfto be quasi-order-valued. Semicontinuity will be defined via level sets of the form {x∈x| α ≤f(x)} or {x∈X|f<α}. Two order-induced topologies will allow the semicontinuity offto be formulated as continuity relative to these topologies. In addition to the question of the existence of maximal values off, the following will be discussed: properties of the order-induced topologies; semicontinuity of the greatest lower bound of a family of semicontinuous functions; partial semicontinuity of functions of the formf:x×Y→z.

ISSN:0323-3898    

DOI:10.1080/02331937908842564

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

G.Schwarze: Simulation – kontinuierliche Systeme. Reihe Automatisierungstechnik, Band 177, VEB Verlag Technik Berlin 1976, 84 S., 4,80 M.

ISSN:0323-3898    

DOI:10.1080/02331937908842565

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

Letf:X→Ya function,Ra relation defined byR⊂X×X×XandSa partial order inx. To each relationRthere exists anR-system consisting of subsets ofXwith an selected subsetX0. Iffpossesses the property of (R,S)-maximality the set ofS-maxima off(X) is equal to the set ofS-maxima off(X0. If possesses the property of (R,S)-minimality the set ofS-minima off(X) is equal to the set ofS-minima off(X0).

ISSN:0323-3898    

DOI:10.1080/02331937908842566

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

A damped variant of Wilsons method of nonlinear programming is formulated and its convergence is proved.

ISSN:0323-3898    

DOI:10.1080/02331937908842567

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

In this paper a necessary and sufficient condition for the existence of a stream in a finite, connected graph is given, when the flow in each are of the graph is to be taken from a convex and closed subset ofRk. The condition is a generalization of the well known condition of A. Hoffman.

ISSN:0323-3898    

DOI:10.1080/02331937908842568

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor

摘要:

An algorithm for obtaining all maximum fronts in a system of sequencing relations is given and its efficiency is proved. The algorithm makes use of the matrix of the relation ships between the activities: “Some activities must end before any other can start.” Due to this it is not necessary to produce the corresponding network by the selection of an optimal sequence of the activities.

ISSN:0323-3898    

DOI:10.1080/02331937908842569

出版商:Akademic-Verlag    

年代:1979

数据来源: Taylor