IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming (Q6498407)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming

scientific article; zbMATH DE number 7843784

Language	Label	Description	Also known as
default for all languages	No label defined
English	IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming	scientific article; zbMATH DE number 7843784

Statements

instance of

scholarly article

0 references

title

IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming (English)

0 references

0 references

0 references

0 references

Computational Optimization and Applications

0 references

publication date

7 May 2024

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

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

Practical Optimization

0 references

Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization

0 references

SDPLIB 1.2, a library of semidefinite programming test problems

0 references

A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization

0 references

Local minima and convergence in low-rank semidefinite programming

0 references

Non-interior continuation methods for solving semidefinite complementarity problems

0 references

A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs

0 references

Benchmarking optimization software with performance profiles.

0 references

Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition

0 references

An Interior-Point Method for Semidefinite Programming

0 references

Extension of smoothing Newton algorithms to solve linear programming over symmetric cones

0 references

Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results

0 references

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

0 references

A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations

0 references

Graph partitioning using linear and semidefinite programming

0 references

A globally convergent primal-dual interior-point relaxation method for nonlinear programs

0 references

A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs

0 references

Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection

0 references

Primal--Dual Path-Following Algorithms for Semidefinite Programming

0 references

Polynomial Convergence of Primal-Dual Algorithms for Semidefinite Programming Based on the Monteiro and Zhang Family of Directions

0 references

First- and second-order methods for semidefinite programming

0 references

Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants

0 references

Extension of primal-dual interior point algorithms to symmetric cones

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

0 references

A study of search directions in primal-dual interior-point methods for semidefinite programming

0 references

On the Nesterov--Todd Direction in Semidefinite Programming

0 references

On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0

0 references

Alternating direction augmented Lagrangian methods for semidefinite programming

0 references

A Primal-Dual Exterior Point Method for Nonlinear Optimization

0 references

SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints

0 references

IPRQP: a primal-dual interior-point relaxation algorithm for convex quadratic programming

0 references

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

0 references

A Newton-CG augmented Lagrangian method for semidefinite programming

0 references

Chordal decomposition in operator-splitting methods for sparse semidefinite programs

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

10.1007/S10589-024-00558-8

0 references

Sitelinks

Mathematics(1 entry)

mardi IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming