A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190): Difference between revisions

Latest revision as of 03:10, 7 July 2024

scientific article

Language	Label	Description	Also known as
English	A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function	scientific article

Statements

instance of

scholarly article

0 references

title

A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (English)

0 references

zbMATH Open document ID

1281.90033

0 references

DOI

10.1007/s40305-013-0023-x

0 references

0 references

0 references

Journal of the Operations Research Society of China

0 references

publication date

27 November 2013

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

kernel function

0 references

interior-point algorithm

0 references

polynomial complexity

0 references

large-update methods

0 references

describes a project that uses

QSDP

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s40305-013-0023-x

0 references

OpenAlex ID

W2029162999

0 references

cites work

A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods

0 references

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

0 references

A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms

0 references

A polynomial-time algorithm for linear optimization based on a new simple kernel function

0 references

A class of large-update and small-update primal-dual interior-point algorithms for linear optimization

0 references

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

0 references

Kernel-function Based Algorithms for Semidefinite Optimization

0 references

A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization

0 references

Q4040931

0 references

Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term

0 references

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

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 potential reduction algorithm for an extended SDP problem

0 references

A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps

0 references

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

0 references

Q4791754

0 references

Q4339096

0 references

An inexact primal-dual path following algorithm for convex quadratic SDP

0 references

Primal-dual interior-point algorithm for convex quadratic semi-definite optimization

0 references

A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:384190

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s40305-013-0023-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2029162999
@@ Property / OpenAlex ID: W2029162999 / rank @@
+Normal rank
@@ Property / cites work @@
+A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
+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 @@
+A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for linear optimization based on a new simple kernel function
+Normal rank
@@ Property / cites work @@
+A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
+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 @@
+Kernel-function Based Algorithms for Semidefinite Optimization
+Normal rank
@@ Property / cites work @@
+A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
+Normal rank
@@ Property / cites work @@
+Q4040931
@@ Property / cites work: Q4040931 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
+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 @@
+A potential reduction algorithm for an extended SDP problem
+Normal rank
@@ Property / cites work @@
+A predictor--corrector algorithm for QSDP combining Dikin-type and Newton centering steps
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Q4791754
@@ Property / cites work: Q4791754 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4339096
@@ Property / cites work: Q4339096 / rank @@
+Normal rank
@@ Property / cites work @@
+An inexact primal-dual path following algorithm for convex quadratic SDP
+Normal rank
@@ Property / cites work @@
+Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
+Normal rank
@@ Property / cites work @@
+A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
+Normal rank
@@ Property / cites work @@
+Handbook of semidefinite programming. Theory, algorithms, and applications
+Normal rank
@@ Property / cites work @@
+A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
+Normal rank