article

A non-interior-point continuation method for linear complementarity problems

Authors:

Bintong Chen,

Patrick T. HarkerAuthors Info & Claims

SIAM Journal on Matrix Analysis and Applications, Volume 14, Issue 4

Pages 1168 - 1190

https://doi.org/10.1137/0614081

Published: 01 October 1993 Publication History

Abstract

No abstract available.

Cited By

View all

Hou DLiang LToh K(2024)A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport ProblemsACM Transactions on Mathematical Software10.1145/368880050:3(1-26)Online publication date: 16-Aug-2024
https://dl.acm.org/doi/10.1145/3688800
Huang BLi W(2023)A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problemsComputational Optimization and Applications10.1007/s10589-023-00482-386:1(345-381)Online publication date: 24-Apr-2023
https://dl.acm.org/doi/10.1007/s10589-023-00482-3
Hou LQian XLiao LSun J(2022)An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex ProgrammingJournal of Scientific Computing10.1007/s10915-022-01765-390:3Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1007/s10915-022-01765-3
Show More Cited By

Index Terms

A non-interior-point continuation method for linear complementarity problems
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
      1. Computations on matrices
  2. Mathematical software

Recommendations

Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems

A first order affine scaling method and two $m$th order affine scaling methods for solving monotone linear complementarity problems (LCPs) are presented. All three methods produce iterates in a wide neighborhood of the central path. The first order ...
Generalized Linear Complementarity Problems

We introduce the concept of the generalized monotone linear complementarity problem GLCP in order to unify LP, convex QP, monotone LCP, and mixed monotone LCP. We establish the basic properties of GLCP and develop canonical forms for its representation. ...
Complexity of large-update interior point algorithm for P_*(_K) linear complementarity problems

In this paper we propose a new large-update primal-dual interior point algorithm for P"*(@k) linear complementarity problems (LCPs). We extend Bai et al.'s primal-dual interior point algorithm for linear optimization (LO) problems to P"*(@k) LCPs with ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image SIAM Journal on Matrix Analysis and Applications

SIAM Journal on Matrix Analysis and Applications Volume 14, Issue 4

Oct. 1993

288 pages

ISSN:0895-4798

Editor:
G. H. Golub
Stanford Univ., Stanford, CA

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 October 1993

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

55
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Hou DLiang LToh K(2024)A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport ProblemsACM Transactions on Mathematical Software10.1145/368880050:3(1-26)Online publication date: 16-Aug-2024
https://dl.acm.org/doi/10.1145/3688800
Huang BLi W(2023)A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problemsComputational Optimization and Applications10.1007/s10589-023-00482-386:1(345-381)Online publication date: 24-Apr-2023
https://dl.acm.org/doi/10.1007/s10589-023-00482-3
Hou LQian XLiao LSun J(2022)An Interior Point Parameterized Central Path Following Algorithm for Linearly Constrained Convex ProgrammingJournal of Scientific Computing10.1007/s10915-022-01765-390:3Online publication date: 1-Mar-2022
https://dl.acm.org/doi/10.1007/s10915-022-01765-3
Chen PLin GZhu XBai F(2021)Smoothing Newton method for nonsmooth second-order cone complementarity problems with application to electric power marketsJournal of Global Optimization10.1007/s10898-021-00993-580:3(635-659)Online publication date: 1-Jul-2021
https://dl.acm.org/doi/10.1007/s10898-021-00993-5
Bui QElman H(2020)Semi-smooth Newton methods for nonlinear complementarity formulation of compositional two-phase flow in porous mediaJournal of Computational Physics10.1016/j.jcp.2019.109163407:COnline publication date: 15-Apr-2020
https://dl.acm.org/doi/10.1016/j.jcp.2019.109163
Sun FChang Y(2019)BiGProceedings of the 56th Annual Design Automation Conference 201910.1145/3316781.3317782(1-6)Online publication date: 2-Jun-2019
https://dl.acm.org/doi/10.1145/3316781.3317782
Qi LHuang Z(2019)Tensor Complementarity Problems—Part II: Solution MethodsJournal of Optimization Theory and Applications10.1007/s10957-019-01568-x183:2(365-385)Online publication date: 1-Nov-2019
https://dl.acm.org/doi/10.1007/s10957-019-01568-x
Chen JRabitz H(2019)On Lifting Operators and Regularity of Nonsmooth Newton Methods for Optimal Control Problems of Differential Algebraic EquationsJournal of Optimization Theory and Applications10.1007/s10957-018-1364-8180:2(518-535)Online publication date: 1-Feb-2019
https://dl.acm.org/doi/10.1007/s10957-018-1364-8
Li GWan Z(2018)On Bilevel Programs with a Convex Lower-Level Problem Violating Slater's Constraint QualificationJournal of Optimization Theory and Applications10.1007/s10957-018-1392-4179:3(820-837)Online publication date: 1-Dec-2018
https://dl.acm.org/doi/10.1007/s10957-018-1392-4
Huang ZQi L(2017)Formulating an n-person noncooperative game as a tensor complementarity problemComputational Optimization and Applications10.1007/s10589-016-9872-766:3(557-576)Online publication date: 1-Apr-2017
https://dl.acm.org/doi/10.1007/s10589-016-9872-7
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems

Generalized Linear Complementarity Problems

Complexity of large-update interior point algorithm for P*(K) linear complementarity problems

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations

Complexity of large-update interior point algorithm for P_*(_K) linear complementarity problems