摘要:

We survey duality theories for quasiconvex optimization problems, based on notions of generalized conjugation. Some of them are obtained from Moreau's generalized conjugation, while the others are special cases of the so-called H-duality. The relationship existing between the two kinds of approaches is described.

ISSN:0233-1934    

DOI:10.1080/02331938808843379

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

An implementation of Karmarkar's algorithm is described which can be characterized by two features. On the one hand only approximate projections are used in determining directions of search and, secondly, variables which are likely to be non-basic are successively eliminated. We demonstrate by examples that the resulting algorithm lies favorable properties with regard to speed and stability.

ISSN:0233-1934    

DOI:10.1080/02331938808843380

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

We present a modified version of Tuy's method for solving d.c. programming problems described in canonical form and some results of computational experiments.

ISSN:0233-1934    

DOI:10.1080/02331938808843381

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

We consider the problem how a convex optimal-value function arising in primal decomposition can be finitely continued beyond its domain. By a suitable presentation of the exact penalty method an implementable continuation can be obtained which does not change the set of optimal solutions. If the problem has separability and partially linearity properties we manage to obtain a complete continuation of the optimal-value function.

ISSN:0233-1934    

DOI:10.1080/02331938808843382

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

In most applications of data analysis quantitative variables are used together with qualitative variables (nominal, ordinal or even of a more complex type). One main task in data analysis is therefore to find an adequate method to analyze a variable set of such different information levels. A well-known approach for this task is the optimal scaling method, which will be illustrated shortly by the linear regression model. The optimal scaling method leads to a constrained nonlinear optimization problem in the Rn, which cannot be solved efficiently by standard methods because of the amount of variables and restrictions. Therefore, a so-called normed alternating least squares (ALS) algorithm is proposed in the literature to solve these optimization problems. Because problems of convergence are only tangent by the literature [2], in this paper some convergence properties of the normed ALS algorithm are given.

ISSN:0233-1934    

DOI:10.1080/02331938808843383

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

Könke, G.:Lineare und stochastische Optimierung mit dem PC. B.G. Teubner Stuttgart 1987, DM 26,80.

ISSN:0233-1934    

DOI:10.1080/02331938808843384

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

Let X be a subset of a Hilbert spaceHandfor alldenote generalized differential with respect to the second argument at the point(x, x).We shall be concerned with the properties of the function IP sufficient to ensure the anti-monotonicity of the mapG(x).It will be shown that for the anti-monotonicity of the mapG(x)it is sufficient to assume convexity-concavity of the function Ψ.In the case of the weakly convex-concave function Ψ the mapG(x)is anti-monotone under some conditions on the remainder terms.In the case of the quasiconvex-concave function Ψ, the condition similar to the anti-monotonicity condition holds.Furthermore, some properties of weakly convex functions will be proved.

ISSN:0233-1934    

DOI:10.1080/02331938808843385

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

Known duality statements are used to find tight bounds for the branch and bound process in solving Boolean quadratic optimization problems. To solve the corresponding continuous partial problem, a NEWTON-like procedure is indicated. Superlinear convergence, however, is only obtained in partial cases.

ISSN:0233-1934    

DOI:10.1080/02331938808843386

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

The paper deals with the reduce of dimension size in the linear mixed integer problem by variables fixing. These criteria are generalizations of the known results for Knapsack-problems. Furthermore strategies of finding feasible solutions are discussed. Numerical tests show the usefulness of these results.

ISSN:0233-1934    

DOI:10.1080/02331938808843387

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

In continuation of the paper [28] Schur parametrizations will be constructed for non-negative Hermitian block matrices and for contractive block matrices.This admits a clear geometrical approach to special problems of entropy optimization.

ISSN:0233-1934    

DOI:10.1080/02331938808843388

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor