Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (Q2353462): Difference between revisions

Latest revision as of 13:04, 10 July 2024

scientific article

Language	Label	Description	Also known as
English	Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term	scientific article

Statements

instance of

scholarly article

0 references

title

Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term (English)

0 references

zbMATH Open document ID

1317.90187

0 references

DOI

10.3934/naco.2015.5.101

0 references

0 references

0 references

0 references

0 references

Numerical Algebra, Control and Optimization

0 references

publication date

14 July 2015

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

interior-point methods

0 references

semidefinite optimization

0 references

kernel function

0 references

large- and small-update methods

0 references

polynomial complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.3934/naco.2015.5.101

0 references

OpenAlex ID

W2525192655

0 references

cites work

A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization

0 references

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

0 references

Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term

0 references

On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function

0 references

Q3415802

0 references

Aspects of semidefinite programming. Interior point algorithms and selected applications

0 references

Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term

0 references

A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions

0 references

Q4040931

0 references

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

0 references

Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs

0 references

New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming

0 references

A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization

0 references

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

0 references

AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS

0 references

Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function

0 references

Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function

0 references

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

0 references

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

0 references

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

0 references

An efficient algorithm for convex quadratic semi-definite optimization

0 references

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

0 references

On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2353462

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.3934/naco.2015.5.101
+Normal rank
@@ Property / OpenAlex ID @@
+W2525192655
@@ Property / OpenAlex ID: W2525192655 / rank @@
+Normal rank
@@ Property / cites work @@
+A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
+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 @@
+Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
+Normal rank
@@ Property / cites work @@
+Q3415802
@@ Property / cites work: Q3415802 / rank @@
+Normal rank
@@ Property / cites work @@
+Aspects of semidefinite programming. Interior point algorithms and selected applications
+Normal rank
@@ Property / cites work @@
+Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
+Normal rank
@@ Property / cites work @@
+A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
+Normal rank
@@ Property / cites work @@
+Q4040931
@@ Property / cites work: Q4040931 / rank @@
+Normal rank
@@ Property / cites work @@
+Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step
+Normal rank
@@ Property / cites work @@
+Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
+Normal rank
@@ Property / cites work @@
+New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming
+Normal rank
@@ Property / cites work @@
+A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
+Normal rank
@@ Property / cites work @@
+Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
+Normal rank
@@ Property / cites work @@
+Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
+Normal rank
@@ Property / cites work @@
+A new primal-dual path-following interior-point algorithm for semidefinite optimization
+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 unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for convex quadratic semi-definite optimization
+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
@@ Property / cites work @@
+On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
+Normal rank