Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
From MaRDI portal
Publication:6596331
DOI10.1007/S10957-022-02139-3MaRDI QIDQ6596331FDOQ6596331
Publication date: 2 September 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
interior-point methodspolynomial complexityweighted linear complementarity problemnew search direction
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A smoothing Newton algorithm for weighted linear complementarity problem
- Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
- Interior-point algorithms for a generalization of linear programming and weighted centring
- Sufficient weighted complementarity problems
- Title not available (Why is that?)
- A polynomial interior-point algorithm for monotone linear complementarity problems
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- A full-Newton step infeasible interior-point method for the special weighted linear complementarity problem
- A full-modified-Newton step \(O(n)\) infeasible interior-point method for the special weighted linear complementarity problem
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
- A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems
This page was built for publication: Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6596331)