On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method

On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method

Bibliographic Details
Main Author:	Popov L.
Format:	Article
Language:	English
Published:	De Gruyter 2004-03-01
Series:	Open Mathematics
Subjects:	infeasible linear complementarity problem lemke’s method tschebyshev approximation 65k05 90c20 90c49
Online Access:	https://doi.org/10.2478/BF02475952

Similar Items

Uncontrolled inexact information within bundle methods
by: Jérôme Malick, et al.
Published: (2017-03-01)

On the rate of convergence of the proximal alternating linearized minimization algorithm for convex problems
by: Ron Shefi, et al.
Published: (2016-02-01)

Two-row and two-column mixed-integer presolve using hashing-based pairing methods
by: Patrick Gemander, et al.
Published: (2020-10-01)

A comparison of four approaches from stochastic programming for large-scale unit-commitment
by: Wim van Ackooij
Published: (2017-03-01)

A new smoothing method for solving nonlinear complementarity problems
by: Zhu Jianguang, et al.
Published: (2019-03-01)

A full-modified-Newton step infeasible interior-point method for monotone linear complementarity problem
by: Nezameddin Mahdavi-Amiri, et al.
Published: (2021-05-01)

Learning to steer nonlinear interior-point methods
by: Renke Kuhlmann
Published: (2019-12-01)

A Dai–Liao conjugate gradient method via modified secant equation for system of nonlinear equations
by: M. Y. Waziri, et al.
Published: (2019-07-01)

INFEASIBLE FULL NEWTON-STEP INTERIOR-POINT METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS
by: Goran Lešaja, et al.
Published: (2012-12-01)

Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
by: Mompati S. Koorapetse, et al.
Published: (2018-05-01)

Complementarity-based nonlinear programming techniques for optimal mixing in gas networks
by: FalkM. Hante, et al.
Published: (2019-09-01)

Restrict-and-relax search for 0-1 mixed-integer programs
by: Menal Guzelsoy, et al.
Published: (2013-05-01)

A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
by: Asadi S., et al.
Published: (2015-01-01)

Improved Full-Newton-Step Infeasible Interior-Point Method for Linear Complementarity Problems
by: Goran Lešaja, et al.
Published: (2016-04-01)

A linear formulation with O(n2) variables for quadratic assignment problems with Manhattan distance matrices
by: Serigne Gueye, et al.
Published: (2015-05-01)

A New Full-Newton Step $O(n)$ Infeasible Interior-Point Algorithm for $P_*(\kappa)$-horizontal Linear Complementarity Problems
by: Soodabeh Asadi, et al.
Published: (2014-03-01)

A globally convergent algorithm for MPCC
by: Abdeslam Kadrani, et al.
Published: (2015-09-01)

New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
by: Hou Zhiwu, et al.
Published: (2019-12-01)

Multiobjective reverse logistics model for inventory management with environmental impacts: An application in industry
by: M. Forkan, et al.
Published: (2022-05-01)

Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems
by: Mirjam Dür, et al.
Published: (2021-01-01)

Computational and topological properties of neural networks by means of graph-theoretic parameters
by: Asad Khan, et al.
Published: (2023-03-01)

A three-term Polak-Ribière-Polyak derivative-free method and its application to image restoration
by: Abdulkarim Hassan Ibrahim, et al.
Published: (2021-09-01)

Evacuation modeling: a case study on linear and nonlinear network flow models
by: Simone Göttlich, et al.
Published: (2016-09-01)

An exact approach for the multi-constraint graph partitioning problem
by: Diego Recalde, et al.
Published: (2020-10-01)

Presolving linear bilevel optimization problems
by: Thomas Kleinert, et al.
Published: (2021-01-01)

A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization
by: Thomas Kleinert, et al.
Published: (2021-01-01)

An effective algorithm for globally solving quadratic programs using parametric linearization technique
by: Tang Shuai, et al.
Published: (2018-11-01)

Combined approach to solve linear complementarity problem
by: Kebbiche Zakia, et al.
Published: (2016-12-01)

Combined approach to solve linear complementarity problem
by: Kebbiche Zakia, et al.
Published: (2016-12-01)

Scarf’s generalization of linear complementarity problem revisited
by: Neogy S.K., et al.
Published: (2013-01-01)

An inertial forward–backward algorithm for the minimization of the sum of two nonconvex functions
by: Radu Ioan Boţ, et al.
Published: (2016-02-01)

First-Order Methods for Convex Optimization
by: Pavel Dvurechensky, et al.
Published: (2021-01-01)

An infeasible interior-point method for the $P_*$-matrix linear complementarity‎ ‎problem based on a trigonometric kernel function with full-Newton‎ ‎step
by: B‎. ‎Kheirfam, et al.
Published: (2018-01-01)

A new conjugate gradient method for acceleration of gradient descent algorithms
by: Rahali Noureddine, et al.
Published: (2021-01-01)

A parametric linearizing approach for quadratically inequality constrained quadratic programs
by: Jiao Hongwei, et al.
Published: (2018-04-01)

The complete vertex p-center problem
by: F.Antonio Medrano
Published: (2020-10-01)

Sufficient pruning conditions for MINLP in gas network design
by: Jesco Humpola, et al.
Published: (2017-03-01)

Robot Dance: A mathematical optimization platform for intervention against COVID-19 in a complex network
by: Luis Gustavo Nonato, et al.
Published: (2022-01-01)

An efficient mathematical model for solving one-dimensional cutting stock problem using sustainable trim
by: Ravi Vishwakarma, et al.
Published: (2021-11-01)

Optimal capacitated ring trees
by: Alessandro Hill, et al.
Published: (2016-05-01)