A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170): Difference between revisions

Latest revision as of 19:26, 15 July 2024

scientific article; zbMATH DE number 6880907

Language	Label	Description	Also known as
English	A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions	scientific article; zbMATH DE number 6880907

Statements

instance of

scholarly article

0 references

title

A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (English)

0 references

0 references

0 references

0 references

5 June 2018

0 references

zbMATH Keywords

symmetric optimization

0 references

interior-point methods

0 references

polynomial complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/02331934.2018.1432610

0 references

cites work

A new polynomial-time algorithm for linear programming

0 references

Q5691079

0 references

Q4382667

0 references

Semidefinite Programming

0 references

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity

0 references

A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming

0 references

Self-Regular Interior-Point Methods for Semidefinite Optimization

0 references

Second-order cone programming

0 references

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

0 references

A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step

0 references

EP theorem for dual linear complementarity problems

0 references

Q2867373

0 references

A polynomial path-following interior point algorithm for general linear complementarity problems

0 references

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

0 references

Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems

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

Barrier Functions in Interior Point Methods

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

Q4321748

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

Extension of primal-dual interior point algorithms to symmetric cones

0 references

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

0 references

Q4324980

0 references

A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier

0 references

Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions

0 references

The accuracy of interior-point methods based on kernel functions

0 references

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

0 references

Q3415802

0 references

Q5309527

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

A polynomial interior-point algorithm for monotone linear complementarity problems

0 references

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

0 references

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

0 references

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

0 references

New method for determining search directions for interior-point algorithms in linear optimization

0 references

Q3738934

0 references

Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions

0 references

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

0 references

Identifiers

zbMATH Open document ID

1400.90304

0 references

DOI

10.1080/02331934.2018.1432610

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5745170

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331934.2018.1432610
+Normal rank
@@ Property / OpenAlex ID @@
+W2794102933
@@ Property / OpenAlex ID: W2794102933 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q5691079
@@ Property / cites work: Q5691079 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4382667
@@ Property / cites work: Q4382667 / rank @@
+Normal rank
@@ Property / cites work @@
+Semidefinite Programming
@@ Property / cites work: Semidefinite Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Aspects of semidefinite programming. Interior point algorithms and selected applications
+Normal rank
@@ Property / cites work @@
+A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
+Normal rank
@@ Property / cites work @@
+A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
+Normal rank
@@ Property / cites work @@
+Self-Regular Interior-Point Methods for Semidefinite Optimization
+Normal rank
@@ Property / cites work @@
+Second-order cone programming
@@ Property / cites work: Second-order cone programming / rank @@
+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 @@
+A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
+Normal rank
@@ Property / cites work @@
+EP theorem for dual linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q2867373
@@ Property / cites work: Q2867373 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial path-following interior point algorithm for general linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A unified approach to interior point algorithms for linear complementarity problems: A summary
+Normal rank
@@ Property / cites work @@
+Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
+Normal rank
@@ Property / cites work @@
+A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
+Normal rank
@@ Property / cites work @@
+Barrier Functions in Interior Point Methods
@@ Property / cites work: Barrier Functions in Interior Point Methods / rank @@
+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 @@
+Q4321748
@@ Property / cites work: Q4321748 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear systems in Jordan algebras and primal-dual interior-point algorithms
+Normal rank
@@ Property / cites work @@
+A Jordan-algebraic approach to potential-reduction algorithms
+Normal rank
@@ Property / cites work @@
+Similarity and other spectral relations for symmetric cones
+Normal rank
@@ Property / cites work @@
+Extension of primal-dual interior point algorithms to symmetric cones
+Normal rank
@@ Property / cites work @@
+Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
+Normal rank
@@ Property / cites work @@
+Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
+Normal rank
@@ Property / cites work @@
+The accuracy of interior-point methods based on kernel functions
+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 @@
+Q3415802
@@ Property / cites work: Q3415802 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5309527
@@ Property / cites work: Q5309527 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
+Normal rank
@@ Property / cites work @@
+A polynomial interior-point algorithm for monotone linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
+Normal rank
@@ Property / cites work @@
+A new primal-dual path-following interior-point algorithm for semidefinite optimization
+Normal rank
@@ Property / cites work @@
+A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS
+Normal rank
@@ Property / cites work @@
+New method for determining search directions for interior-point algorithms in linear optimization
+Normal rank
@@ Property / cites work @@
+Q3738934
@@ Property / cites work: Q3738934 / rank @@
+Normal rank
@@ Property / cites work @@
+Interior-point methods for Cartesian<i>P</i><sub>*</sub>(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions
+Normal rank
@@ Property / cites work @@
+Full Nesterov-Todd step infeasible interior-point method for symmetric optimization
+Normal rank