Optimization under functional constraints (semi—infinite programming) and applications

R Hettich, M Gugat - Modern Methods of Optimization: Proceedings of the …, 1992 - Springer
In this paper, we will give an introductory review on theory, methods a. nd applications of
semi-infinite programming. In part I, linear problems are considered, which form a subclass …

[图书][B] Linear optimization and approximation: an introduction to the theoretical analysis and numerical treatment of semi-infinite programs

K Glashoff, SA Gustafson - 2012 - books.google.com
A linear optimization problem is the task of minimizing a linear real-valued function of finitely
many variables subject to linear con straints; in general there may be infinitely many …

Semi-infinite programming: theory, methods, and applications

R Hettich, KO Kortanek - SIAM review, 1993 - SIAM
Starting from a number of motivating and abundant applications in § 2, including control of
robots, eigenvalue computations, mechanical stress of materials, and statistical design, the …

Nonsmooth analysis and parametric optimization

I Ekeland, P Marcellini, A Marino, M Tosques… - … at the 1st Session of the …, 1990 - Springer
In an optimization problem that depends on parameters, an important issue is the effect that
perturbations of the parameters can have on solutions to the problem and their associated …

Strictly concave parametric programming, Part I: Basic theory

AM Geoffrion - Management Science, 1966 - pubsonline.informs.org
This paper, which is presented in two parts, develops a computational approach to strictly
concave parametric programs of the form: Maximize α f 1 (x)+(1− α) f 2 (x) subject to concave …

[引用][C] Parametric optimization: Special issue of ZOR mathematical methods of operations research

J Guddat, JJ Rückmann - Zeitschrift für Operations Research, 1995 - Springer
Parametric optimization is a part of mathematical programming and it investigates the
behaviour and the properties of solution sets of optimization problems under variations of …

Algorithms for the resolution of optimization and minimax problems

B Martinet - 1972 - inis.iaea.org
[en] This work presents a mathematical study of algorithms for the resolution approach of
optimization problems and certain other problems having similar characteristics: minimax …

The penalty method in linear programming and its realization on a computer

II Erëmin, MA Kostina - USSR Computational Mathematics and …, 1967 - Elsevier
ESTIMATES are established below for the closeness of the optimal values and optimal
solutions of the problems (original) and, where M 0 and M are convex polyhedral sets of the …

An algorithmic approach to nonlinear analysis and optimization (edward j. beltrami); the approximate minimization of functionals (james w. daniel); approximate …

MZ Nashed - SIAM Review, 1977 - SIAM
1. The main subject of the five books under review is optimization theory and algorithms.
Concepts and methods from functional analysis are heavily used in four of these books …

[PDF][PDF] Constrained minimization methods

BT Polyak, ES LEVITIN - USSR Compu-tational Mathematics and …, 1966 - cs.ubc.ca
~~ S~ AI~~ extreme problems form a wide class of
zyxwvutsrqponmlkjihgfedcbaZYXWVUTSR problems often encountered in pure and applied …