Projects
Reading
People
Chat
SU\G
(𝔸)
/K·U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
An Algorithm Based on Weighted Logarithmic Barrier Functions for Linear Complementarity Problems
Jiu Ding
,
T.Y. Li
Type:
Article
Publication Date:
1990-01-01
Citations:
24
View Publication
Share
Locations
Arabian Journal for Science and Engineering -
View
Similar Works
Action
Title
Year
Authors
+
A proximal method with logarithmic barrier for nonlinear complementarity problems
2015
Rolando Gárciga Otero
Alfredo N. Iusem
+
A new smoothing-type algorithm for nonlinear weighted complementarity problem
2020
Ziyu Liu
Jingyong Tang
+
Algorithms for Linear Complementarity Problems
1994
Joaquím J. Júdice
+
A smoothing Newton algorithm for weighted linear complementarity problem
2015
Jian Zhang
+
A reweighted $$\ell _1$$-penalty method for nonlinear complementarity problems
2025
Boshi Tian
Xie Chang
+
A new logarithmic-quadratic proximal method for nonlinear complementarity problems
2009
Abdellah Bnouhachem
Muhammad Aslam Noor
Mohamed Khalfaoui
Zhaohan Sheng
+
A potential-reduction algorithm for linear complementarity problems
2004
Yanjin Wang
Pusheng Fei
Zi-zong Yan
+
An algorithm for a class of nonlinear complementarity problems with non-Lipschitzian functions
2014
Yong Wang
Jianxun Zhao
+
A barrier method in convex vector optimization with generalized inequality constraints
2019
Marius Durea
Radu Strugariu
+
Solution of linear complementarity problems using minimization with simple bounds
1995
Ana Friedlander
J. M. Martı́nez
Sandra A. Santos
+
A power penalty method for linear complementarity problems
2007
Song Wang
Xiaoqi Yang
+
A smoothing Newton algorithm for linear weighted complementarity problems
2024
+
A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
2010
Tie Ni
Ping Wang
+
An adaptive step method for a class of linear complementarity problems
1991
Sanjay Mehrotra
+
New smooth weighted complementarity functions and a cubically convergent method for wLCP
2024
Tiantian Fan
Jingyong Tang
+
Barrier function algorithms for linear and convex quadratic programming
1988
Mohamed Ben‐Daya
+
An iterative two-step algorithm for linear complementarity problems
1994
M. Kov cvara
Jochem Zowe
+
A power penalty approach to a Nonlinear Complementarity Problem
2009
Chongchao Huang
Song Wang
+
A Long-step barrier method for convex quadratic programming
1993
Kurt M. Anstreicher
Dick den Hertog
C. Roos
Tamás Terlaky
+
A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions
2016
Mohamed A. Tawhid
Wei-Zhe Gu
Benjamin Tran
Works That Cite This (22)
Action
Title
Year
Authors
+
Interior Point Methods for Linear Optimization
2005
C. Roos
Tamás Terlaky
J.‐P. Vial
+
Uniform bounds on the limiting and marginal derivatives of the analytic center solution over a set of normalized weights
2000
Allen Holder
Richard J. Caron
+
PDF
Chat
A Full Nesterov-Todd Step Feasible Weighted Primal-Dual Interior-Point Algorithm for Symmetric Optimization
2013
Behrouz Kheirfam
+
A continuation algorithm for a class of linear complementarity problems using an extrapolation technique
1993
Jiu Ding
+
PDF
Chat
A weighted full-Newton step primal-dual interior point algorithm for convex quadratic optimization
2014
Mohamed Achache
+
Primal-dual target-following algorithms for linear programming
1996
Benjamin Jansen
C. Roos
Tamás Terlaky
Jean-Philippe Vial
+
Long-step primal-dual target-following algorithms for linear programming
1996
Benjamin Jansen
C. Roos
Tamás Terlaky
Jean-Philippe Vial
+
Differentiable Optimization and Equation Solving: A Treatise on Algorithmic Science and the Karmarkar Revolution
2011
J. L. Nazareth
+
PDF
Chat
A weighted full-Newton step primal-dual interior point algorithm for convex quadratic optimization
2014
Mohamed Achache
+
PDF
Chat
A Weighted-path Following Interior-point Algorithm for Convex Quadratic Optimization Based on Modified Search Directions
2022
Nouha Moussaoui
Mohamed Achache
Works Cited by This (0)
Action
Title
Year
Authors