Relevant bibliographies by topics / Mixed Linear Complementarity Problem (MLCP)

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Conference papers

Academic literature on the topic 'Mixed Linear Complementarity Problem (MLCP)'

Author: Grafiati
Published: 24 April 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Mixed Linear Complementarity Problem (MLCP).'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Mixed Linear Complementarity Problem (MLCP)"

1

EFFATI, SOHRAB, ABBAS GHOMASHI, and MASUMEH ABBASI. "A NOVEL RECURRENT NEURAL NETWORK FOR SOLVING MLCPs AND ITS APPLICATION TO LINEAR AND QUADRATIC PROGRAMMING PROBLEMS." Asia-Pacific Journal of Operational Research 28, no. 04 (2011): 523–41. http://dx.doi.org/10.1142/s0217595911003223.

Full text
Abstract:
In this paper, we present a recurrent neural network for solving mixed linear complementarity problems (MLCPs) with positive semi-definite matrices. The proposed neural network is derived based on an NCP function and has a low complexity respect to the other existing models. In theoretical and numerical aspects, global convergence of the proposed neural network is proved. As an application, we show that the proposed neural network can be used to solve linear and convex quadratic programming problems. The validity and transient behavior of the proposed neural network are demonstrated by using f
APA, Harvard, Vancouver, ISO, and other styles
2

Sun, Hongchun, and Yiju Wang. "The Solution Set Characterization and Error Bound for the Extended Mixed Linear Complementarity Problem." Journal of Applied Mathematics 2012 (2012): 1–15. http://dx.doi.org/10.1155/2012/219478.

Full text
Abstract:
For the extended mixed linear complementarity problem (EML CP), we first present the characterization of the solution set for the EMLCP. Based on this, its global error bound is also established under milder conditions. The results obtained in this paper can be taken as an extension for the classical linear complementarity problems.
APA, Harvard, Vancouver, ISO, and other styles
3

Djeumou Fomeni, Franklin, Steven A. Gabriel, and Miguel F. Anjos. "An RLT approach for solving the binary-constrained mixed linear complementarity problem." Computers & Operations Research 110 (October 2019): 48–59. http://dx.doi.org/10.1016/j.cor.2019.05.008.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Wang, Guo-qiang, Yu-jing Yue, and Xin-zhong Cai. "Weighted-Path-Following Interior-Point Algorithm to Monotone Mixed Linear Complementarity Problem." Fuzzy Information and Engineering 1, no. 4 (2009): 435–45. http://dx.doi.org/10.1007/s12543-009-0033-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gowda, M. Seetharama, and Jong-Shi Pang. "Stability Analysis of Variational Inequalities and Nonlinear Complementarity Problems, via the Mixed Linear Complementarity Problem and Degree Theory." Mathematics of Operations Research 19, no. 4 (1994): 831–79. http://dx.doi.org/10.1287/moor.19.4.831.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gondzio, Jacek, and E. Alper Yıldırım. "Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations." Journal of Global Optimization 81, no. 2 (2021): 293–321. http://dx.doi.org/10.1007/s10898-021-01017-y.

Full text
Abstract:
AbstractA standard quadratic program is an optimization problem that consists of minimizing a (nonconvex) quadratic form over the unit simplex. We focus on reformulating a standard quadratic program as a mixed integer linear programming problem. We propose two alternative formulations. Our first formulation is based on casting a standard quadratic program as a linear program with complementarity constraints. We then employ binary variables to linearize the complementarity constraints. For the second formulation, we first derive an overestimating function of the objective function and establish
APA, Harvard, Vancouver, ISO, and other styles
7

Jiang, Xiaoqin, and He Huang. "A Smoothing Newton Method with a Mixed Line Search for Monotone Weighted Complementarity Problems." Mathematical Problems in Engineering 2020 (June 30, 2020): 1–10. http://dx.doi.org/10.1155/2020/7986351.

Full text
Abstract:
In this paper, we present a smoothing Newton method for solving the monotone weighted complementarity problem (WCP). In each iteration of our method, the iterative direction is achieved by solving a system of linear equations and the iterative step length is achieved by adopting a line search. A feature of the line search criteria used in this paper is that monotone and nonmonotone line search are mixed used. The proposed method is new even when the WCP reduces to the standard complementarity problem. Particularly, the proposed method is proved to possess the global convergence under a weak as
APA, Harvard, Vancouver, ISO, and other styles
8

Gao, Hai Tao, Ya Li Han, Fei Hao, and Song Qing Zhu. "Numerical Simulation for Non-Smooth Contact Problem in Mechanical Systems." Applied Mechanics and Materials 341-342 (July 2013): 491–95. http://dx.doi.org/10.4028/www.scientific.net/amm.341-342.491.

Full text
Abstract:
Friction and contact phenomenon widely exist in mechanical systems. In order to tackle the frictional contact problem of mechanical systems, efficient numerical resolution methods and simulation methods are put forward. A mixed nonlinear complementary model describing frictional contact problem is built based on time-stepping method and complementarity theories. In order to solve the model effectively, the block matrix method and linearization method are used to change the mixed nonlinear complementary problem into a linear complementary problem which can be easily solved. At last, the validit
APA, Harvard, Vancouver, ISO, and other styles
9

Gui, Zhuqing, Chunyan Hu, and Zhibin Zhu. "A Mixed Line Search Smoothing Quasi-Newton Method for Solving Linear Second-Order Cone Programming Problem." ISRN Operations Research 2013 (March 27, 2013): 1–9. http://dx.doi.org/10.1155/2013/230717.

Full text
Abstract:
Firstly, we give the Karush-Kuhn-Tucker (KKT) optimality condition of primal problem and introduce Jordan algebra simply. On the basis of Jordan algebra, we extend smoothing Fischer-Burmeister (F-B) function to Jordan algebra and make the complementarity condition smoothing. So the first-order optimization condition can be reformed to a nonlinear system. Secondly, we use the mixed line search quasi-Newton method to solve this nonlinear system. Finally, we prove the globally and locally superlinear convergence of the algorithm.
APA, Harvard, Vancouver, ISO, and other styles
10

Liu, Nan, Hui Pang, and Rui Yao. "Robust Mixed H2/H∞ State Feedback Controller Development for Uncertain Automobile Suspensions with Input Delay." Processes 8, no. 3 (2020): 359. http://dx.doi.org/10.3390/pr8030359.

Full text
Abstract:
In order to achieve better dynamics performances of a class of automobile active suspensions with the model uncertainties and input delays, this paper proposes a generalized robust linear H2/H∞ state feedback control approach. First, the mathematical model of a half-automobile active suspension is established. In this model, the H∞ norm of body acceleration is determined as the performance index of the designed controller, and the hard constraints of suspension dynamic deflection, tire dynamic load and actuator saturation are selected as the generalized H2 performance output index of the desig
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Mixed Linear Complementarity Problem (MLCP)"

1

Kim, Jingu. "Nonnegative matrix and tensor factorizations, least squares problems, and applications." Diss., Georgia Institute of Technology, 2011. http://hdl.handle.net/1853/42909.

Full text
Abstract:
Nonnegative matrix factorization (NMF) is a useful dimension reduction method that has been investigated and applied in various areas. NMF is considered for high-dimensional data in which each element has a nonnegative value, and it provides a low-rank approximation formed by factors whose elements are also nonnegative. The nonnegativity constraints imposed on the low-rank factors not only enable natural interpretation but also reveal the hidden structure of data. Extending the benefits of NMF to multidimensional arrays, nonnegative tensor factorization (NTF) has been shown to be successful in
APA, Harvard, Vancouver, ISO, and other styles
2

Stępień, Jakub. "Physics-based animation of articulated rigid body systems for virtual environments." Rozprawa doktorska, 2013. https://repolis.bg.polsl.pl/dlibra/docmetadata?showContent=true&id=12190.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Stępień, Jakub. "Physics-based animation of articulated rigid body systems for virtual environments." Rozprawa doktorska, 2013. https://delibra.bg.polsl.pl/dlibra/docmetadata?showContent=true&id=12190.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Mixed Linear Complementarity Problem (MLCP)"

1

Enzenhöfer, Andreas, Albert Peiret, Marek Teichmann, and József Kövecses. "A Unit-Consistent Error Measure for Mixed Linear Complementarity Problems in Multibody Dynamics With Contact." In ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2018. http://dx.doi.org/10.1115/detc2018-85232.

Full text
Abstract:
Modeling multibody systems subject to unilateral contacts and friction efficiently is challenging, and dynamic formulations based on the mixed linear complementarity problem (MLCP) are commonly used for this purpose. The accuracy of the MLCP solution method can be evaluated by determining the error introduced by it. In this paper, we find that commonly used MLCP error measures suffer from unit inconsistency leading to the error lacking any physical meaning. We propose a unit-consistent error measure which computes energy error components for each constraint dependent on the inverse effective m
APA, Harvard, Vancouver, ISO, and other styles
2

Wu, Jiaoyu. "Mixed-Type Splitting Iterative Method for Linear Complementarity Problem." In 2009 International Joint Conference on Computational Sciences and Optimization, CSO. IEEE, 2009. http://dx.doi.org/10.1109/cso.2009.224.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Wang, Guoqiang, Xinzhong Cai, and Yujing Yue. "A New Polynomial Interior-Point Algorithm for Monotone Mixed Linear Complementarity Problem." In 2008 Fourth International Conference on Natural Computation. IEEE, 2008. http://dx.doi.org/10.1109/icnc.2008.245.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Bhalerao, Kishor D., Kurt S. Anderson, and Jeffery C. Trinkle. "A Recursive Hybrid Time-Stepping Scheme for Intermittent Contact in Multi-Rigid-Body Dynamics." In ASME 2009 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/detc2009-86774.

Full text
Abstract:
This paper describes a novel method for the modeling of intermittent contact in multi-rigid-body problems. We use a complementarity based time-stepping scheme in Featherstone’s Divide and Conquer framework to efficiently model the unilateral and bilateral constraints in the system. The time-stepping scheme relies on impulse-based equations and does not require explicit collision detection. A set of complementarity conditions is used to model the interpenetration constraint and a linearized friction cone is used to yield a linear complementarity problem. The Divide and Conquer framework ensures
APA, Harvard, Vancouver, ISO, and other styles
5

Chakraborty, Nilanjan, Stephen Berard, Srinivas Akella, and Jeff Trinkle. "An Implicit Time-Stepping Method for Quasi-Rigid Multibody Systems With Intermittent Contact." In ASME 2007 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. ASMEDC, 2007. http://dx.doi.org/10.1115/detc2007-35526.

Full text
Abstract:
We recently developed a time-stepping method for simulating rigid multi-body systems with intermittent contact that is implicit in the geometric information [1]. In this paper, we extend this formulation to quasi-rigid or locally compliant objects, i.e., objects with a rigid core surrounded by a compliant layer, similar to Song et al. [2]. The difference in our compliance model from existing quasi-rigid models is that, based on physical motivations, we assume the compliant layer has a maximum possible normal deflection beyond which it acts as a rigid body. Therefore, we use an extension of the
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography