Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 14 of 14 for “"Linear complementarity Problem"”.
-
Kernel-Based Interior-Point Algorithms for the Linear Complementarity Problem
In this thesis, we consider the Linear Complementarity Problem (LCP), which is a well-known mathematical problem with many practical applications. The objective of the LCP is to find a certain vector that will satisfy a set of linear inequalities and (non-linear) complementary equation. A …
-
Full Newton Step Interior Point Method for Linear Complementarity Problem Over Symmetric Cones
… a new Feasible Interior-Point Method (IPM) for Linear Complementarity Problem (LPC) over Symmetric Cones. The advantage of this method lies in that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. By suitable choice of parameters we prove the global …
-
On solving the vertical generalized linear complementarity problem associated with a vertical block P-matrix
… was developed to solve the vertical generalized linear complementarity problem (VGLCP) when the associated matrix is a vertical block P-matrix (VBP). The objective of this study is to implement the algorithm on a large scale using the Python programming language. We also use a Python code to …
-
A finite characterization of K-matrices in dimensions less than four
… matrices M, known as K-matrices, for t which the linear complementarity problem w-Mz=q, w≥O, z≥O, w<sup>t</sup>z=O has a solution whenever w-Mz=q, w≥O, z≥O has a solution is characterized for dimensions n<4. The characterization is finite and"practical". Several necessary conditions, sufficient …
-
Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems
… a new Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the …
-
Infeasible Full-Newton-Step Interior-Point Method for the Linear Complementarity Problems
… Interior-Point Method (IPM) for monotone Linear Complementarity Problem (LPC). The advantage of the method is that it uses full Newton-steps, thus, avoiding the calculation of the step size at each iteration. However, by suitable choice of parameters the iterates are forced to stay in the …
-
ΥΠΟΛΟΓΙΣΜΟΣ ΚΑΙ ΑΝΑΛΥΣΗ ΚΙΝΗΤΗΣ ΜΕΤΑΛΛΙΚΗΣ ΑΡΠΑΓΗΣ ΡΟΜΠΟΤ
… BEHAVIOUR OF THE SYSTEM IS CONSIDERED AND THE PROBLEM IS FORMULATED AS A LINEAR COMPLEMENTARITY PROBLEM. IN THE CASE WHERE THE FRICTION PHENOMENON IS INCLUDED, THE FORMULATION COVERS THE TWO TYPES OF FINGERS: HARD AND SOFT. THE CONCEPTS OF FORM-AND FORCE-CLOSURE ARE USED AS QUALITY CRITERION …
-
Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
… Interior-Point Method (IIPM) for monotone Linear Complementarity Problem (LCP). One of the most important advantages of this version in compare to old version is that it only requires feasibility steps. In the earlier version, each iteration consisted of one feasibility step and some …
-
The complexity of continuous local search
… of capturing the complexity of some well-known problems in PPAD ∩ PLS that have resisted, in some cases for decades, attempts to put them in polynomial time. No complete problem was known for CLS, and in [9], the problems CONTRACTION, i.e., the problem of finding an approximate fixpoint of a …
-
The mathematical modelling and numerical solution of options pricing problems
… for a selection of financial options pricing problems. The methods are based on finite difference discretisation coupled with optimal solvers of the resulting discrete systems. Regular Cartesian meshes have been combined with orthogonal co-ordinate transformations chosen for numerical accuracy …
-
Enhanced intersection cutting plane and reformulation-linearization enumeration based approaches for linear complementarity problems
In this research effort, we consider the linear complementarity problem (LCP) that arises in diverse areas including optimal control, economics, engineering, mechanics, and quadratic programming. This class of problems has posed a challenge to researchers for over three decades now. Most of the …
-
Centralized and distributed resource allocation with applications to signal processing in communications
… and deeply analyze multiuser resource allocation problems in different areas, ranging from signal processing, to communications and networking. More specifically, this work focuses on the three main topics that we briefly describe next. First, we study the maximum sum-utility achieved when a …
-
Computational Study of Kernel - Based Interior - Point Method for LCP
<p>One of mathematical problems, that have many practical applications, is the well-known linear complementary problem (LCP) which consists of finding a certain vector that satisfy a set of linear inequalities and complementary equation. In this thesis, after introducing and analyzing a …
-
ΕΦΑΡΜΟΓΗ ΤΩΝ ΜΕΘΟΔΩΝ ΤΟΥ ΤΕΤΡΑΓΩΝΙΚΟΥ ΠΡΟΓΡΑΜΜΑΤΙΣΜΟΥ ΣΤΑ ΠΡΟΒΛΗΜΑΤΑ ΤΗΣ ΘΕΩΡΙΑΣ ΠΛΑΣΤΙΚΟΤΗΤΑΣ
… SHOWS HOW IT IS POSSIBLE TO STUDY THE PROBLEMS OF THE THEORY OF PLASTICITY IN THEIR INCREMENTALAND HOLONOMIC FORMULATION, BOTH AS MECHANICAL PROBLEMS WHOSE SOLUTION IS SOUGHT AND AS FREE BOUNDARY PROBLEMS BETWEEN ELASTICITY AND PLASTICITY. FIRST THE ALGORITHM OF H. THEIL AND C. VAN DE …