scholarly journals Bound constrained quadratic programming via piecewise quadratic functions

1999 ◽  
Vol 85 (1) ◽  
pp. 135-156 ◽  
Author(s):  
Kaj Madsen ◽  
Hans Bruun Nielsen ◽  
Mustafa Ç. Pınar
Keyword(s):  
Quadratic Programming ◽  
Quadratic Functions ◽  
Piecewise Quadratic Functions

scholarly journals On the Locally Polynomial Complexity of the Projection-Gradient Method for Solving Piecewise Quadratic Optimisation Problems

Entropy ◽  
2021 ◽  
Vol 23 (4) ◽  
pp. 465
Author(s):  
Agnieszka Prusińska ◽  
Krzysztof Szkatuła ◽  
Alexey Tret’yakov
Keyword(s):  
Computational Complexity ◽  
Polynomial Complexity ◽  
Initial Point ◽  
Quadratic Functions ◽  
Problem Dimension ◽  
Piecewise Quadratic Functions ◽  
Large Systems ◽  
Systems Of Linear Inequalities ◽  
Number Of Iterations ◽  
Finite Number Of Iterations

This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of the problem dimension, i.e., if the initial point belongs to the sufficiently small neighbourhood of the solution set. Proposed method could be applied for solving large systems of linear inequalities.

scholarly journals On Certain Problems of Identification of Thermal Density of the Temperature State of the Hollow Cylinder Shell

2020 ◽  
pp. 32-40
Author(s):  
Albina Aralova
Keyword(s):  
Finite Element Method ◽  
Optimal Control ◽  
Finite Element ◽  
Cylindrical Shell ◽  
Gradient Methods ◽  
Quadratic Functions ◽  
Temperature State ◽  
Piecewise Quadratic Functions ◽  
Theory Of Optimal Control ◽  
Element Method

Introduction. In conditions of the active use of composite materials, as when accomplishing the tasks of extending the service life of existing structures, problems on recovering unknown parameters of their components under the known data on their surface arise. In [1-4], to solve the problems of identification ofparameters of a wide range, it is proposed to construct explicit expressions of the gradients of residual functionals by means of the corresponding conjugate problems obtained from the theory of optimal control of the states of multicomponent distributed systems, which is the development of the corresponding researches of Zh. Lyons. In [5-7], this technology is extended to the problem of thermoelastic deformation of multicomponent bodies. In this article some problems of optimal control of the temperature state of a cylindrical body with a cavity are considered. The purpose of the paper is to show the algorithm for identifying the parameters of a cylindrical hollow shell, based on the theory of optimal control and using the gradient methods of Alifanov. Results. Based on the theory of optimal control, the temperature control of a cylindrical shell is studied. To solve the problem of identifying the parameters of a hollow cylindrical shell, namely, finding the heat flux powers on its surfaces, based on [1,2,5-7], a direct and conjugate problem and gradients of non-viscous functionals are constructed. Discretization by the finite element method using piecewise quadratic functions is carried out and accuracy estimates for it are presented. The initial problem in the model examples presented is solved using gradient methods, where at each step of determining the (n + 1) the approximation of the solution, the direct and adjoint problems are solved using finite element method with the help piecewise quadratic functions by minimizing the corresponding energy functional. A number of model examples solved.

scholarly journals An efficient optimization algorithm for quadratic programming problem and its applications to mobile robot path planning

2018 ◽  
Vol 15 (1) ◽  
pp. 172988141774844 ◽  
Author(s):  
Lei Cai ◽  
Juanjuan Yang ◽  
Li Zhao ◽  
Lan Wu
Keyword(s):  
Path Planning ◽  
Quadratic Programming ◽  
Mobile Robot ◽  
Programming Problem ◽  
Branch And Bound ◽  
Optimization Algorithm ◽  
Quadratic Functions ◽  
Quadratic Programming Problem ◽  
Robot Path Planning ◽  
Robot Path

The quadratic programming problem has broad applications in mobile robot path planning. This article presents an efficient optimization algorithm for globally solving the quadratic programming problem. By utilizing the convexity of univariate quadratic functions, we construct the linear relaxation programming problem of the quadratic programming problem, which can be embedded within a branch-and-bound structure without introducing new variables and constraints. In addition, a new pruning technique is inserted into the branch-and-bound framework for improving the speed of the algorithm. The global convergence of the proposed algorithm is proved. Compared with some known algorithms, numerical experiment not only demonstrates the higher computational efficiency of the proposed algorithm but also proves that the proposed algorithm is an efficient approach to solve the problems of path planning for the mobile robot.

scholarly journals Solving the problem of combination of Multi-fuel electric generator units using lagrange multiplier theory

2013 ◽  
Vol 16 (2) ◽  
pp. 54-62
Author(s):  
Kien Chi Le ◽  
Cuong Minh Duc Nguyen
Keyword(s):  
Lagrange Multiplier ◽  
Power Plants ◽  
Unit Commitment ◽  
Thermal Power ◽  
Quadratic Functions ◽  
Electricity Production ◽  
Mathematical Function ◽  
Unit Commitment Problem ◽  
Commitment Problem ◽  
Piecewise Quadratic Functions

This paper presents an approach to solve the unit commitment problem with multifuel options in the thermal power plants. Traditionally, each generator unit is used to each fuel option with the segmented piecewise quadratic functions, so that it is not difficult to solve them. However, it is more realistic to represent the fuel cost function for each fossil fired plant as the segmented piecewise quadratic functions. Those units are faced with the difficulty of determining which fuel is the most economical to burn. Therefore, this paper presents an approach to solve the unit commitment problem with multi-fuel options. An advantage of the method is to formulate Lagrange mathematical function easily based on the Lagrange multiplier theory. The simulation result for 10 generator systems are compared with others methods to show that the approach is a new method and an effective method to solve the minimizing of electricity production cost of generator units with multi-fuel option.

scholarly journals TOPOLOGY-GUIDED TESSELLATION OF QUADRATIC ElEMENTS

2009 ◽  
Vol 19 (02) ◽  
pp. 195-211 ◽  
Author(s):  
SCOTT E. DILLARD ◽  
VIJAY NATARAJAN ◽  
GUNTHER H. WEBER ◽  
VALERIO PASCUCCI ◽  
BERND HAMANN
Keyword(s):  
Level Sets ◽  
Piecewise Linear ◽  
Quadratic Function ◽  
Linear Functions ◽  
Quadratic Functions ◽  
Piecewise Linear Functions ◽  
Reeb Graph ◽  
Triangle Meshes ◽  
Triangular Patch ◽  
Piecewise Quadratic Functions

Topology-based methods have been successfully used for the analysis and visualization of piecewise-linear functions defined on triangle meshes. This paper describes a mechanism for extending these methods to piecewise-quadratic functions defined on triangulations of surfaces. Each triangular patch is tessellated into monotone regions, so that existing algorithms for computing topological representations of piecewise-linear functions may be applied directly to the piecewise-quadratic function. In particular, the tessellation is used for computing the Reeb graph, a topological data structure that provides a succinct representation of level sets of the function.

Sign in / Sign up

Export Citation Format

Share Document