Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (Q5275296): Difference between revisions

Latest revision as of 08:23, 30 July 2024

scientific article; zbMATH DE number 6741604

Language	Label	Description	Also known as
English	Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach	scientific article; zbMATH DE number 6741604

Statements

instance of

scholarly article

0 references

title

Solving Conic Optimization Problems via Self-Dual Embedding and Facial Reduction: A Unified Approach (English)

0 references

0 references

0 references

0 references

SIAM Journal on Optimization

0 references

publication date

11 July 2017

0 references

zbMATH Keywords

conic optimization

0 references

self-dual embedding

0 references

facial reduction

0 references

homogeneous model

0 references

describes a project that uses

0 references

0 references

0 references

0 references

Benchmarks for Optimization Software

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

cites work

Projections of Convex Programs with Unattained Infima

0 references

Notes on Duality in Second Order and p -Order Cone Optimization

0 references

Cones of diagonally dominant matrices

0 references

Q4830373

0 references

Regularizing the abstract convex program

0 references

Preprocessing and Regularization for Degenerate Semidefinite Programs

0 references

Initialization in semidefinite programming via a self-dual skew-symmetric embedding

0 references

Q4517100

0 references

Genericity Results in Linear Conic Programming—A Tour d’Horizon

0 references

On the behavior of the homogeneous self-dual model for conic convex optimization

0 references

Q3236242

0 references

On the Convergence of the Central Path in Semidefinite Optimization

0 references

Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming

0 references

Solving SDP completely with an interior point oracle

0 references

An independent benchmarking of SDP and SOCP solvers

0 references

Conic optimization via operator splitting and homogeneous self-dual embedding

0 references

Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals

0 references

Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone

0 references

On homogeneous interrior-point algorithms for semidefinite programming

0 references

On the central paths in symmetric cone programming

0 references

Incorporating Condition Measures into the Complexity Theory of Linear Programming

0 references

Q4235027

0 references

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

0 references

Error Bounds for Linear Matrix Inequalities

0 references

Facial reduction algorithms for conic optimization problems

0 references

Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization

0 references

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm

0 references

full work available at URL

https://doi.org/10.1137/15m1049415

0 references

Identifiers

zbMATH Open document ID

1368.90123

0 references

DOI

10.1137/15M1049415

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5275296

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Projections of Convex Programs with Unattained Infima
+Normal rank
@@ Property / cites work @@
+Notes on Duality in Second Order and p -Order Cone Optimization
+Normal rank
@@ Property / cites work @@
+Cones of diagonally dominant matrices
@@ Property / cites work: Cones of diagonally dominant matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q4830373
@@ Property / cites work: Q4830373 / rank @@
+Normal rank
@@ Property / cites work @@
+Regularizing the abstract convex program
@@ Property / cites work: Regularizing the abstract convex program / rank @@
+Normal rank
@@ Property / cites work @@
+Preprocessing and Regularization for Degenerate Semidefinite Programs
+Normal rank
@@ Property / cites work @@
+Initialization in semidefinite programming via a self-dual skew-symmetric embedding
+Normal rank
@@ Property / cites work @@
+Q4517100
@@ Property / cites work: Q4517100 / rank @@
+Normal rank
@@ Property / cites work @@
+Genericity Results in Linear Conic Programming—A Tour d’Horizon
+Normal rank
@@ Property / cites work @@
+On the behavior of the homogeneous self-dual model for conic convex optimization
+Normal rank
@@ Property / cites work @@
+Q3236242
@@ Property / cites work: Q3236242 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Convergence of the Central Path in Semidefinite  Optimization
+Normal rank
@@ Property / cites work @@
+Exact duals and short certificates of infeasibility and weak infeasibility in conic linear programming
+Normal rank
@@ Property / cites work @@
+Solving SDP completely with an interior point oracle
+Normal rank
@@ Property / cites work @@
+An independent benchmarking of SDP and SOCP solvers
+Normal rank
@@ Property / cites work @@
+Conic optimization via operator splitting and homogeneous self-dual embedding
+Normal rank
@@ Property / cites work @@
+Strong Duality in Conic Linear Programming: Facial Reduction and Extended Duals
+Normal rank
@@ Property / cites work @@
+Partial facial reduction: simplified, equivalent SDPs via approximations of the PSD cone
+Normal rank
@@ Property / cites work @@
+On homogeneous interrior-point algorithms for semidefinite programming
+Normal rank
@@ Property / cites work @@
+On the central paths in symmetric cone programming
+Normal rank
@@ Property / cites work @@
+Incorporating Condition Measures into the Complexity Theory of Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4235027
@@ Property / cites work: Q4235027 / rank @@
+Normal rank
@@ Property / cites work @@
+Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
+Normal rank
@@ Property / cites work @@
+Error Bounds for Linear Matrix Inequalities
@@ Property / cites work: Error Bounds for Linear Matrix Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Facial reduction algorithms for conic optimization problems
+Normal rank
@@ Property / cites work @@
+Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
+Normal rank
@@ Property / cites work @@
+An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1137/15m1049415
+Normal rank
@@ Property / OpenAlex ID @@
+W2724786773
@@ Property / OpenAlex ID: W2724786773 / rank @@
+Normal rank