Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP (Q5299915)

scientific article; zbMATH DE number 6179996

Language	Label	Description	Also known as
English	Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP	scientific article; zbMATH DE number 6179996

Statements

instance of

scholarly article

0 references

title

Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP (English)

0 references

zbMATH Open document ID

1267.90157

0 references

DOI

10.1080/10556788.2013.781600

0 references

0 references

0 references

Optimization Methods and Software

0 references

publication date

24 June 2013

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

interior-point methods

0 references

linear complementarity problem

0 references

Cartesian \(P_{\ast}(\kappa )\)-property

0 references

Euclidean Jordan algebra and symmetric cones

0 references

Nesterov-Todd scaling

0 references

full-step updates

0 references

polynomial complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10556788.2013.781600

0 references

OpenAlex ID

W2067037813

0 references

cites work

A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

0 references

Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem

0 references

Function spaces and reproducing kernels on bounded symmetric domains

0 references

Euclidean Jordan algebras and interior-point algorithms

0 references

Linear systems in Jordan algebras and primal-dual 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

Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras

0 references

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

0 references

Barrier Functions in Interior Point Methods

0 references

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

0 references

Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP

0 references

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

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

0 references

VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS

0 references

Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones

0 references

Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions

0 references

Cluster synchronization for linearly coupled complex networks

0 references

Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones

0 references

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

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 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

A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property

0 references

Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points

0 references

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

0 references

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

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

Q4339096

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP

0 references

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

0 references

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

0 references

A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones

0 references

A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization

0 references

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

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5299915

Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP (Q5299915)

Statements

Sitelinks

Mathematics(1 entry)