Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions

Etienne de Klerk; C. Roos; Tamás Terlaky

doi:10.1016/s0168-9274(98)00101-9

ScienceGate Book Chapters

JOURNAL ARTICLE

Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions

Etienne de Klerk C. Roos Tamás Terlaky

Year: 1999 Journal: Applied Numerical Mathematics Vol: 29 (3)Pages: 335-360 Publisher: Elsevier BV

DOI: 10.1016/s0168-9274(98)00101-9

Get Full-Text PDF Get Analytical Report

Keywords:

Mathematics Semidefinite programming Semidefinite embedding Reduction (mathematics) Affine transformation Scaling Dual (grammatical number) Affine combination Mathematical optimization Applied mathematics Linear programming Quadratically constrained quadratic program Pure mathematics Quadratic programming Geometry

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.25

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Optimization Algorithms Research

Physical Sciences → Mathematics → Numerical Analysis

Sparse and Compressive Sensing Techniques

Physical Sciences → Engineering → Computational Mechanics

Probabilistic and Robust Engineering Design

Social Sciences → Decision Sciences → Statistics, Probability and Uncertainty

Primal-dual potential reduction methods for semidefinite programming using affine-scaling directions

Metrics

Citation History

Topics

Related Documents

Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming

Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming

Polynomial primal-dual cone affine scaling for semidefinite programming

A primal—dual affine-scaling potential-reduction algorithm for linear programming

Primal-Dual Affine-Scaling Methods