Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

Josef Stoer; Martin Wechs

doi:10.1007/bf02680568

ScienceGate Book Chapters

JOURNAL ARTICLE

Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

Josef Stoer Martin Wechs

Year: 1998 Journal: Mathematical Programming Vol: 83 (1-3)Pages: 407-423 Publisher: Springer Science+Business Media

DOI: 10.1007/bf02680568

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Complementarity (molecular biology) Linear complementarity problem Complementarity theory Interior point method Mixed complementarity problem Solution set Path (computing) Linear algebra Applied mathematics Mathematical optimization Set (abstract data type) Nonlinear system Geometry Computer science

Metrics

Cited By

3.96

FWCI (Field Weighted Citation Impact)

Refs

0.94

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

Matrix Theory and Algorithms

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Topics in Algebra

Physical Sciences → Mathematics → Algebra and Number Theory

Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

Metrics

Citation History

Topics

Related Documents

Infeasible interior point methods for sufficient linear complementarity problems

On the analyticity properties of infeasible-interior-point paths for monotone linear complementarity problems

High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems

Analysis of infeasible-interior-point paths arising with semidefinite linear complementarity problems

An infeasible-interior-point algorithm for linear complementarity problems