A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem

DOI10.3934/jimo.2021082OpenAlexW3154081134MaRDI QIDQ2086935

Zijun Hao, Xiaoni Chi, Zhong-Ping Wan

Publication date: 26 October 2022

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2021082

zbMATH Keywords

polynomial complexityinfeasible interior-point methodweighted linear complementarity problemfull-modified-Newton step

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (1)

An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems

Cites Work

• Unnamed Item
• Unnamed Item
• A smoothing Newton algorithm for weighted linear complementarity problem
• Sufficient weighted complementarity problems
• A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
• A full-Newton step interior-point algorithm based on modified Newton direction
• The weighted horizontal linear complementarity problem on a Euclidean Jordan algebra
• A polynomial-time interior-point method for circular cone programming based on kernel functions
• A new polynomial-time algorithm for linear programming
• The solution set structure of monotone linear complementarity problems over second-order cone
• Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization
• SOC functions and their applications
• A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
• A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
• A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
• A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A path to the Arrow-Debreu competitive market equilibrium
• A full-modified-Newton step infeasible interior-point algorithm for linear optimization
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
• Interior-point algorithms for a generalization of linear programming and weighted centring
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
• Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems

This page was built for publication: A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem