On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (Q425872): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.na.2009.05.078 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1999253911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347846 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-regular functions and new search directions for linear and semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2773659 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4841249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aspects of semidefinite programming. Interior point algorithms and selected applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of search directions in primal-dual interior-point methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Nesterov--Todd Direction in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-Scaled Barriers and Interior-Point Methods for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric primal-dual path-following algorithms for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040931 / rank
 
Normal rank

Latest revision as of 07:27, 5 July 2024

scientific article
Language Label Description Also known as
English
On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
scientific article

    Statements

    On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function (English)
    0 references
    0 references
    0 references
    9 June 2012
    0 references
    semidefinite optimization problem
    0 references
    primal
    0 references
    dual interior-point methods
    0 references
    kernel function
    0 references
    proximity function
    0 references
    complexity analysis
    0 references
    worst-case iteration bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers