A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (Q2911579): Difference between revisions

Latest revision as of 15:44, 5 July 2024

scientific article

Language	Label	Description	Also known as
English	A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS	scientific article

Statements

instance of

scholarly article

0 references

title

A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (English)

0 references

published in

Asia-Pacific Journal of Operational Research

0 references

publication date

31 August 2012

0 references

zbMATH Keywords

symmetric cone linear complementarity problem

0 references

interior-point algorithm

0 references

Euclidean Jordan algebra

0 references

small-update method

0 references

iteration bound

0 references

author

Guo-Qiang Wang

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

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

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 Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

0 references

Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions

0 references

Q5309527

0 references

Q4321748

0 references

Euclidean Jordan algebras and interior-point algorithms

0 references

A Jordan-algebraic approach to potential-reduction algorithms

0 references

Smoothing Functions for Second-Order-Cone Complementarity Problems

0 references

Full Nesterov-Todd step infeasible interior-point method for symmetric optimization

0 references

A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems

0 references

Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search

0 references

Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices

0 references

A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems

0 references

SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS

0 references

An $O(rL)$ infeasible interior-point algorithm for symmetric cone LCP via CHKS function

0 references

On a commutative class of search directions for linear programming over symmetric cones

0 references

Self-Scaled Barriers and Interior-Point Methods for Convex Programming

0 references

Primal-Dual Interior-Point Methods for Self-Scaled Cones

0 references

Self-regular functions and new search directions for linear and semidefinite optimization

0 references

Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities

0 references

AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS

0 references

Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

0 references

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

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem

0 references

Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function

0 references

A new primal-dual path-following interior-point algorithm for semidefinite optimization

0 references

Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones

0 references

Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path

0 references

Identifiers

zbMATH Open document ID

1247.90272

0 references

DOI

10.1142/S0217595912500157

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2911579

@@ Property / cites work @@
+Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
+Normal rank
@@ Property / cites work @@
+A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
+Normal rank
@@ Property / cites work @@
+Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
+Normal rank
@@ Property / cites work @@
+Q5309527
@@ Property / cites work: Q5309527 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4321748
@@ Property / cites work: Q4321748 / rank @@
+Normal rank
@@ Property / cites work @@
+Euclidean Jordan algebras and interior-point algorithms
+Normal rank
@@ Property / cites work @@
+A Jordan-algebraic approach to potential-reduction algorithms
+Normal rank
@@ Property / cites work @@
+Smoothing Functions for Second-Order-Cone Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
+Normal rank
@@ Property / cites work @@
+A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
+Normal rank
@@ Property / cites work @@
+Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
+Normal rank
@@ Property / cites work @@
+A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
+Normal rank
@@ Property / cites work @@
+SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS
+Normal rank
@@ Property / cites work @@
+An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function
+Normal rank
@@ Property / cites work @@
+On a commutative class of search directions for linear programming over symmetric cones
+Normal rank
@@ Property / cites work @@
+Self-Scaled Barriers and Interior-Point Methods for Convex Programming
+Normal rank
@@ Property / cites work @@
+Primal-Dual Interior-Point Methods for Self-Scaled Cones
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
+Normal rank
@@ Property / cites work @@
+AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
+Normal rank
@@ Property / cites work @@
+Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones
+Normal rank
@@ Property / cites work @@
+A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
+Normal rank
@@ Property / cites work @@
+Extension of primal-dual interior point algorithms to symmetric cones
+Normal rank
@@ Property / cites work @@
+Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem
+Normal rank
@@ Property / cites work @@
+Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
+Normal rank
@@ Property / cites work @@
+A new primal-dual path-following interior-point algorithm for semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
+Normal rank
@@ Property / cites work @@
+Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
+Normal rank