Titlebook: Semi-Infinite Programming; Recent Advances Miguel á. Goberna,Marco A. López Book 2001 Springer Science+Business Media Dordrecht 2001 algori

確定無(wú)疑

無(wú)禮回復(fù)

天賦

尊嚴(yán)

Semi-Infinite Programming978-1-4757-3403-4Series ISSN 1571-568X

BRACE

Stability of the Feasible Set Mapping in Convex Semi-Infinite Programmingisely, we establish its closedness and study the semicontinuity, in the sense of Berge, of this multivalued mapping- A certain metric is proposed in order to measure the distance between nominal and perturbed problems. Since we do not require any structure to the index set, our results cover the ordinary convex programming problem.

Gossamer

On Some Applications of LSIP to Probability and Statisticsto several problems in probability and statistics, including a subjective view on probability theory maintained by de Finetti, a constrained maximum likelihood estimation problem, and some relevant topics in risk theory. This work is intended as an addendum to the review of LSIP applications contained in [5].

罵人有污點(diǎn)

Adulterate

On Regularity and Optimality in Nonlinear Semi-Infinite ProgrammingThis paper deals with semi-infinite convex optimization problems. In particular, a regularity condition introduced recently by Guerra and Jimenez for the lin ear case is extended to the convex case, employing a suitable generalization of Haar’s condition. The convergence of an exchange process under such Haar-like conditions is investigated.

concise

Analytic Center Based Cutting Plane Method for Linear Semi-Infinite ProgrammingIn this paper, an analytic center based cutting plane method is proposed for solving linear semi-infinite programming problems. It is shown that a near optimal solution can be obtained by generating a polynomial number of cuts.

conception