A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (Q398651): Difference between revisions

Latest revision as of 16:26, 9 December 2024

scientific article

Language	Label	Description	Also known as
English	A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems	scientific article

Statements

instance of

scholarly article

0 references

title

A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems (English)

0 references

author

Behrouz Kheirfam

0 references

published in

Journal of Optimization Theory and Applications

0 references

publication date

15 August 2014

0 references

zbMATH Keywords

horizontal linear complementarity problem

0 references

infeasible interior-point methods

0 references

full-Newton step

0 references

complexity analysis

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s10957-013-0457-7

0 references

cites work

A new polynomial-time algorithm for linear programming

0 references

An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

0 references

A quadratically convergent $\text{O}((\kappa +1)\sqrt n L)$-iteration algorithm for the $P_ *(\kappa)$-matrix linear complementarity problem

0 references

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming

0 references

A unified approach to interior point algorithms for linear complementarity problems: A summary

0 references

Corrector-predictor methods for sufficient linear complementarity problems

0 references

Polynomial interior-point algorithms for $P_*(\kappa )$ horizontal linear complementarity problem

0 references

Q3415802

0 references

Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems

0 references

Polynomial interior-point algorithm for $P_\ast(\kappa)$ horizontal linear complementarity problems

0 references

A predictor-corrector interior-point algorithm for $P_\ast (\kappa )$-horizontal linear complementarity problem

0 references

Feasibility issues in a primal-dual interior-point method for linear programming

0 references

A primal-dual infeasible-interior-point algorithm for linear programming

0 references

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

0 references

Polynomiality of infeasible-interior-point algorithms for linear programming

0 references

A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP

0 references

Q5691079

0 references

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

0 references

A full-Newton step $O(n)$ infeasible-interior-point algorithm for linear complementarity problems

0 references

A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY

0 references

Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step

0 references

Q2865887

0 references

Q5409921

0 references

Simplified analysis for full-Newton step infeasible interior-point algorithm for semidefinite programming

0 references

An infeasible-interior-point predictor-corrector algorithm for the $P_ *$-geometric LCP

0 references

Q4339096

0 references

Improved full-Newton step $O(nL)$ infeasible interior-point method for linear optimization

0 references

On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP

0 references

A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems

0 references

Identifiers

zbMATH Open document ID

1293.90072

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1007/S10957-013-0457-7

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:398651

@@ Property / DOI @@
-.1007/S10957-013-0457-7
@@ Property / DOI: 10.1007/S10957-013-0457-7 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S10957-013-0457-7
@@ Property / DOI: 10.1007/S10957-013-0457-7 / rank @@
+Normal rank