Temat: large-scale optimization

Skocz do pozycji: 1.

Tytuł:: Large-scale nonlinear programming algorithm using projection methods
Autorzy:: Białoń, Paweł
Tematy:: nonlinear optimization
large scale optimization
projection methods
zigzagging; Pokaż więcej
Data publikacji:: 2000
Powiązania:: https://bibliotekanauki.pl/articles/729340.pdf Link otwiera się w nowym oknie
Źródło:: Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2000, 20, 2; 171-194
1509-9407
Pojawia się w:: Discussiones Mathematicae, Differential Inclusions, Control and Optimization
Opis:: A method for solving large convex optimization problems is presented. Such problems usually contain a big linear part and only a small or medium nonlinear part. The parts are tackled using two specialized (and thus efficient) external solvers: purely nonlinear and large-scale linear with a quadratic goal function. The decomposition uses an alteration of projection methods. The construction of the method is based on the zigzagging phenomenon and yields a non-asymptotic convergence, not dependent on a large dimension of the problem. The method preserves its convergence properties under limitations in complicating sets by geometric cuts. Various aspects and variants of the method are analyzed theoretically and experimentally.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 2.

Tytuł:: A heuristic approach to optimizing the loading of homogeneous marine cargo
Autorzy:: Bernardelli, Michał
Tematy:: large-scale optimization
cargo loading
heuristic
marine transportation
suboptimality; Pokaż więcej
Data publikacji:: 2022
Powiązania:: https://bibliotekanauki.pl/articles/2175836.pdf Link otwiera się w nowym oknie
Źródło:: Operations Research and Decisions; 2022, 32, 2; 1--15
2081-8858
2391-6060
Pojawia się w:: Operations Research and Decisions
Opis:: In this article, the optimal loading of homogeneous marine cargo is considered. A mathematical formulation in terms of a mixed-integer linear program can be given. Still, the level of complexity turns out to be too high to perform full-scale computations. On the one hand, the reasons for this are the multitude of variables and constraints. On the other hand, feasible solutions to such problems may often be economically unacceptable or simply empty. Therefore, a heuristic is presented, according to which the relaxation of the limiting conditions influencing the solution’s feasibility and its economic profitability was parametrized. Under this heuristic, shifting the deadlines of selected orders is allowed. Also, the assignment of orders to vessels is separated from the allocation of vessels to piers in loading and unloading ports. The solution presented can be easily generalized by adding additional restrictions or features like indirect vessels, founding cost, or differentiation between materials.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 3.

Tytuł:: Object library of algorithms for dynamic optimization problems; Benchmarking SQP and nonlinear interior point methods
Autorzy:: Błaszczyk, J.
Karbowski, A.
Malinowski, K.
Tematy:: optymalizacja dynamiczna
programowanie kwadratowe sekwencyjne
różniczkowanie automatyczne
obliczenia numeryczne
analiza danych
dynamic optimization
large-scale optimization
sequential quadratic programming
nonlinear interior-point methods
object-oriented numerical computations
automatic differentiation
performance data analysis; Pokaż więcej
Data publikacji:: 2007
Powiązania:: https://bibliotekanauki.pl/articles/929795.pdf Link otwiera się w nowym oknie
Źródło:: International Journal of Applied Mathematics and Computer Science; 2007, 17, 4; 515-537
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Opis:: The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods of derivative evaluation that we used, in particular automatic differentiation. Further, we briefly formulate and characterize the class of problems solved by our optimization classes. The solution of dynamic optimization problems with general constraints is performed by transformation into structured large-scale nonlinear programming problems and applying methods for nonlinear optimization. Two main algorithms of solvers for constrained dynamic optimization are presented in detail: the sequential quadratic programming (SQP) exploring the multistage structure of the dynamic optimization problem during the solution of a sequence of quadratic subproblems, and the nonlinear interior-point method implemented in a general-purpose large-scale optimizer IPOPT. At the end, we include a typical numerical example of the application of the constrained solvers to a large-scale discrete-time optimal control problem and we use the performance profiles methodology to compare the efficiency and robustness of different solvers or different options of the same solver. In conclusions, we summarize our experience gathered during the library development.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Skocz do pozycji: 4.

Tytuł:: Technology of large-scale objects system optimization
Autorzy:: Beskorovainyi, V.
Imanhulova, Z.
Tematy:: large-scale objects
structure
design
reengineering
topology
optimization; Pokaż więcej
Data publikacji:: 2017
Powiązania:: https://bibliotekanauki.pl/articles/410841.pdf Link otwiera się w nowym oknie
Źródło:: ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes; 2017, 6, 4; 3-8
2084-5715
Pojawia się w:: ECONTECHMOD : An International Quarterly Journal on Economics of Technology and Modelling Processes
Opis:: The analysis of system factors determining the efficiency of large-scale objects is performed. Structural description and purposes of large-scale objects constructing are formalized. A three-level decomposition scheme for the problem of objects system optimization including the set of tasks for their system design, planning of development, adaptation and reengineering is proposed. The composition and the scheme of relationship on input and output data of the tasks between main stages of large-scale objects system optimization are determined. Based on the decomposition of the problem, its systemological analysis was carried out. This allowed to develop a technology for system optimization of large-scale objects, taking into account the relationship between the whole set of problem-related tasks.
Dostawca treści:: Biblioteka Nauki

Artykuł

na półce

Informacja

Wyszukujesz frazę "large-scale optimization" wg kryterium: Temat