Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "convex programming" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Minimization of a concave function on a convex polyhedron
    Autorzy:
    Kryński, Stanisław L.
    Powiązania:
    https://bibliotekanauki.pl/articles/747846.pdf
    Data publikacji:
    1982
    Wydawca:
    Polskie Towarzystwo Matematyczne
    Tematy:
    Convex programming
    Nonlinear programming
    Opis:
    .
    The problem of minimizing a concave function on a convex polyhedron is considered. The author proposes a solution algorithm which, starting from a vertex representing a local minimum of the objective function, constructs a sequence of auxiliary linear programming problems in order to find a global minimum. The convergence of the algorithm is proven.
    Źródło:
    Mathematica Applicanda; 1982, 10, 21
    1730-2668
    2299-4009
    Pojawia się w:
    Mathematica Applicanda
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Algorithm for the stochastic generalized transportation problem
    Autorzy:
    Anholcer, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/406627.pdf
    Data publikacji:
    2012
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    generalized transportation problem
    stochastic programming
    convex programming
    equalization method
    Opis:
    The equalization method for the stochastic generalized transportation problem has been presented. The algorithm allows us to find the optimal solution to the problem of minimizing the expected total cost in the generalized transportation problem with random demand. After a short introduction and literature review, the algorithm is presented. It is a version of the method proposed by the author for the nonlinear generalized transportation problem. It is shown that this version of the method generates a sequence of solutions convergent to the KKT point. This guarantees the global optimality of the obtained solution, as the expected cost functions are convex and twice differentiable. The computational experiments performed for test problems of reasonable size show that the method is fast.
    Źródło:
    Operations Research and Decisions; 2012, 22, 4; 9-20
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Properties of projection and penalty methods for discretized elliptic control problems
    Autorzy:
    Cegielski, Andrzej
    Grossmann, Christian
    Powiązania:
    https://bibliotekanauki.pl/articles/729435.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
    Tematy:
    convex programming
    control of PDE
    projection methods
    penalty methods
    Opis:
    In this paper, properties of projection and penalty methods are studied in connection with control problems and their discretizations. In particular, the convergence of an interior-exterior penalty method applied to simple state constraints as well as the contraction behavior of projection mappings are analyzed. In this study, the focus is on the application of these methods to discretized control problem.
    Źródło:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization; 2007, 27, 1; 23-41
    1509-9407
    Pojawia się w:
    Discussiones Mathematicae, Differential Inclusions, Control and Optimization
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analytical Model for Optimum Warehouse Dimensions
    Autorzy:
    Karakis, I.
    Baskak, M.
    Tanyaş, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/409344.pdf
    Data publikacji:
    2015
    Wydawca:
    Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej
    Tematy:
    facilities planning and design
    warehouse dimensioning
    nonlinear programming
    convex programming
    supply chain management
    Opis:
    Warehouses are essential components of any supply chain in terms of customer service and cost levels. Warehouses are one of the important players in the success or failure of businesses from not only the customer service levels perspective but also the cost perspective. Warehouses, as one of the important components of supply networks, should be continually improved from design and operation perspectives to increase the performance. All efforts and solutions regarding the performance improvement are important and complex. In other words, warehouses should operate effectively in terms of the costs and technical performance that are determined during the design phase of warehouses. There are a few studies in the literature regarding the calculations of the optimum dimensions of a warehouse along the x, y, and z directions. In this paper, an analytical model is proposed to achieve the optimum warehouse dimensions in terms of the number of stocking zones along each of three dimensional axes directions: the x-, y-, and z-axes as non-linear mathematical modelling is developed to ensure the optimality. The warehouse dimensions (length, width, and height under the rafter of the building) are then calculated according to the results obtained from the model to minimise the average travel time.
    Źródło:
    Research in Logistics & Production; 2015, 5, 3; 255-269
    2083-4942
    2083-4950
    Pojawia się w:
    Research in Logistics & Production
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A primal-infeasible interior point algorithm for linearly constrained convex programming
    Autorzy:
    Wang, Y.
    Fei, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/969664.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    linearly constrained convex programming
    primal-infeasible interior point algorithm
    polynomial complexity
    Opis:
    In this paper a primal-infeasible interior point algorithm is proposed for linearly constrained convex programming. A positive primal-infeasible dual-feasible point can be taken as the starting point of this algorithm in a large region. At each iterates it requires to solve approximately a nonlinear system. The polynomial complexity of the algorithm is obtained. It is shown that, after finite iterations a sufficiently good approximation to the optimal point is found, or there is no optimal point in a large region.
    Źródło:
    Control and Cybernetics; 2009, 38, 3; 687-704
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Convex optimization of thrust allocation in a dynamic positioning simulation system
    Autorzy:
    Zalewski, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/135112.pdf
    Data publikacji:
    2016
    Wydawca:
    Akademia Morska w Szczecinie. Wydawnictwo AMSz
    Tematy:
    dynamic positioning
    thrust allocation
    convex optimization
    configurations
    programming
    simulator
    Opis:
    Vessels conducting dynamic positioning (DP) operations are usually equipped with thruster configurations that enable the generation of resultant force and moment in any direction. These configurations are deliberately redundant in order to reduce the consequences of thruster failures and increase the safety. On such vessels a thrust allocation system must be used to distribute the control actions determined by the DP controller among the thrusters. The optimal allocation of thrusters’ settings in DP systems is a problem that can be solved by several convex optimization methods depending on criteria and constraints used. The paper presents linear programming (LP) and quadratic programming (QP) methods adopted in the DP control model which is being developed at the Maritime University of Szczecin for ship simulation purposes.
    Źródło:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 48 (120); 58-62
    1733-8670
    2392-0378
    Pojawia się w:
    Zeszyty Naukowe Akademii Morskiej w Szczecinie
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Lagrange principle and necessary conditions
    Autorzy:
    Tikhomirov, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/970737.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    mathematical programming
    convex analysis
    calculus of variations
    optimal control
    Lagrange multiplier rule
    Opis:
    Necessary conditions of extremum (from the times of Fermat and Lagrange till our times) for extremal problems where smoothness is interlaced with convexity, and some type of regularity takes place, correspond to a unique general principle, which is due to Lagrange. This report is devoted to the Lagrange principle in the theory of optimization.
    Źródło:
    Control and Cybernetics; 2009, 38, 4B; 1589-1605
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Second order convexity and a modified objective function method in mathematical programming
    Autorzy:
    Antczak, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/969778.pdf
    Data publikacji:
    2007
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie matematyczne
    mathematical programming
    second order modified objective function optimization problem
    second order convex function
    second order optimality conditions
    Opis:
    An approach to nonlinear constrained mathematical programming problems which makes use of a second order derivative is presented. By using a second order modified objective function method, a modified optimization problem associated with a primal mathematical programming problem is constructed. This auxiliary optimization problem involves a second order approximation of an objective function constituting the primal mathematical programming problem. The equivalence between the original mathematical programming problem and its associated modified optimization problem is established under second order convexity assumption. Several practical O.R. applications show that our method is efficient. Further, an iterative algorithm based on this approach for solving the considered nonlinear mathematical programming problem is given for the case when the functions constituting the problem are second order convex. The convergence theorems for the presented algorithm are established.
    Źródło:
    Control and Cybernetics; 2007, 36, 1; 161-182
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies