摘要:

The notion of covering is introduced for a set-valued mapping defined on an arbitrary set in a Banach space. A necessary and sufficient covering criterion is proved. The conditions are formulated in terms of generalized differentials and generalized normals. The covering theorem is applied to deduce formulas of generalized differential calculus and necessary optimality conditions for nonsroooth optimization problems.

ISSN:0233-1934    

DOI:10.1080/02331938808843391

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

In this paper we present an algorithm to solve a family of finite covering problems in.

ISSN:0233-1934    

DOI:10.1080/02331938808843392

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

A cutting plane algorithm for solving convex quadratic semi-infinite programming problems is presented. Nonbinding constraints can be dropped. Its arithmetic convergence rate is proved by taking into consideration the error of the approximate solution of the auxiliary problem to calculate the most violate constraint. An implementable variant of this method is described which is due to the adaptive discretization of the index set and its stability is shown. Computational experiments show the behaviour of the method.

ISSN:0233-1934    

DOI:10.1080/02331938808843393

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

Walter, W. (ed.): General Inequalities 5. Birkhäuser Verlag Basel, 1987, 502 S., DM 114, –, ISBN 3-76543-1799-X.

ISSN:0233-1934    

DOI:10.1080/02331938808843394

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

In this paper conditions are given to assure global convergence for a broad class of aggregation algorithms of linear programming. For a more restrictive class properties of the accumulation points are also given, even if global convergence conditions are not satisfied.

ISSN:0233-1934    

DOI:10.1080/02331938808843395

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

An exact penalty approach for solving minimization problems with a concave objective function, linear constraints and Boolean variables is proposed. The penalty problems have continuous variables. An estimation of the penalty parameter which guarantees the exactness can be calculated on the base of an auxiliary problem. The results are applied to problems with an arbitrary quadratic objective function, linear constraints and Boolean variables. This leads to a modified Lagrangean approach for the latter problems. In the general case, the penalty approach is compared with a direct application of results of global optimization to a modification of the initial problem.

ISSN:0233-1934    

DOI:10.1080/02331938808843396

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

This paper introduces an efficient approach to the solution of the linear mini-max approximation problem. The classical nonlinear minimax problem is cast into a linear formulation. The proposed optimization procedure consists of specifying first a feasible point belonging to the feasible boundary surface. Next, feasible directions of decreasing values of the objective function are determined. The algorithm proceeds iteratively and terminates when the absolute minimum value of the objective function is reached. The initial point May be selected arbitrarily or it May be optimally determined through a linear method to speed up algorithmic convergence. The algorithm was applied to a number of approximation problems and results were compared to those derived using the revised simplex method. The new algorithm is shown to speed up the problem solution by at least on order of magnitude.

ISSN:0233-1934    

DOI:10.1080/02331938808843397

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

An optimal control problem governed by a variational inequality of elliptic type is considered. Necessary optimality conditions are obtained and, in some special cases, the optimal control is determined.

ISSN:0233-1934    

DOI:10.1080/02331938808843398

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

Hofmann, B.: Regularization for Applied Inverse and III-Posed Problems. Teubner Texte zur Mathematik. 85. Teubner Leipzinig, 19987, 196 S., M 19, –, ISBN 3-322-00341-8.

ISSN:0233-1934    

DOI:10.1080/02331938808843399

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor

摘要:

In this paper the problem of the generation of all elements of a system of sets is investigated and a backtrack algorithm (Al) is given solving this problem.The algorithm is applied to combinatorial problems of reliability:

ISSN:0233-1934    

DOI:10.1080/02331938808843400

出版商:Akademic-Verlag    

年代:1988

数据来源: Taylor