Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Self-Regular Interior-Point Methods for Semidefinite Optimization - MaRDI portal

Self-Regular Interior-Point Methods for Semidefinite Optimization (Q2802533)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Self-Regular Interior-Point Methods for Semidefinite Optimization	scientific article

Statements

scholarly article

0 references

Self-Regular Interior-Point Methods for Semidefinite Optimization (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-1-4614-0769-0_15

0 references

0 references

0 references

International Series in Operations Research & Management Science

0 references

publication date

26 April 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-0769-0_15

0 references

0 references

An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

0 references

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

0 references

Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results

0 references

0 references

Kernel-function Based Algorithms for Semidefinite Optimization

0 references

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

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

An Interior-Point Method for Semidefinite Programming

0 references

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

0 references

A tight semidefinite relaxation of the MAX CUT problem

0 references

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

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

0 references

A new class of polynomial primal-dual methods for linear and semidefinite optimization

0 references

0 references

AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS

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

Semidefinite Programming

0 references

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

0 references

Handbook of semidefinite programming. Theory, algorithms, and applications

0 references

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

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2802533

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2802533&oldid=36245005"