Pages that link to "Item:Q4764307"

The following pages link to Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization (Q4764307):

Displayed 50 items.

• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) ‎ (← links)
• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) ‎ (← links)
• Semi-definite relaxation algorithm of multiple knapsack problem (Q698390) ‎ (← links)
• The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems (Q702592) ‎ (← links)
• Stochastic semidefinite programming: a new paradigm for stochastic optimization (Q862822) ‎ (← links)
• Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling (Q868464) ‎ (← links)
• Theory of semidefinite programming for sensor network localization (Q868476) ‎ (← links)
• Properties of the augmented Lagrangian in nonlinear semidefinite optimization (Q868537) ‎ (← links)
• Lower-order penalization approach to nonlinear semidefinite programming (Q995945) ‎ (← links)
• Role of redundant constraints for improving dual bounds in polynomial optimization problems (Q1288665) ‎ (← links)
• Robust stability and performance analysis of uncertain systems using linear matrix inequalities (Q1289389) ‎ (← links)
• Affine scaling algorithm fails for semidefinite programming (Q1290670) ‎ (← links)
• Polynomial primal-dual cone affine scaling for semidefinite programming (Q1294555) ‎ (← links)
• Symmetric primal-dual path-following algorithms for semidefinite programming (Q1294556) ‎ (← links)
• Applications of semidefinite programming (Q1294557) ‎ (← links)
• A long-step primal-dual path-following method for semidefinite programming (Q1306474) ‎ (← links)
• Problems of distance geometry and convex properties of quadratic maps (Q1346137) ‎ (← links)
• Approximability of maximum splitting of k-sets and some other Apx-complete problems (Q1350605) ‎ (← links)
• Semidefinite programming in combinatorial optimization (Q1365053) ‎ (← links)
• Cuts, matrix completions and graph rigidity (Q1365058) ‎ (← links)
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs (Q1380924) ‎ (← links)
• Semidefinite programming and matrix scaling over the semidefinite cone. (Q1414710) ‎ (← links)
• Best ellipsoidal relaxation to solve a nonconvex problem. (Q1421225) ‎ (← links)
• Indefinite stochastic LQ control with cross term via semidefinite programming (Q1429334) ‎ (← links)
• On weighted centers for semidefinite programming (Q1584796) ‎ (← links)
• Heuristics for semirandom graph problems (Q1604213) ‎ (← links)
• On self-regular IPMs (with comments and rejoinder) (Q1769946) ‎ (← links)
• Discretization method for semi-definite programming (Q1770709) ‎ (← links)
• A new proof of the strong duality theorem for semidefinite programming (Q1771002) ‎ (← links)
• A unified class of directly solvable semidefinite programming problems (Q1772965) ‎ (← links)
• Inverse conic programming with applications (Q1779714) ‎ (← links)
• Analyticity of the central path at the boundary point in semidefinite programming (Q1848384) ‎ (← links)
• Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming (Q1887719) ‎ (← links)
• Some geometric results in semidefinite programming (Q1905963) ‎ (← links)
• Linear programming, complexity theory and elementary functional analysis (Q1924066) ‎ (← links)
• Semidefinite programming relaxations for the graph partitioning problem (Q1961466) ‎ (← links)
• A potential reduction algorithm for an extended SDP problem (Q1974204) ‎ (← links)
• Graph rigidity via Euclidean distance matrices (Q1978125) ‎ (← links)
• Algorithmic and explicit determination of the Lovász number for certain circulant graphs (Q2383537) ‎ (← links)
• A Newton's method for perturbed second-order cone programs (Q2385540) ‎ (← links)
• Approximation algorithms for maximum cut with limited unbalance (Q2456360) ‎ (← links)
• Solvability of semidefinite complementarity problems (Q2474860) ‎ (← links)
• Exploiting semidefinite relaxations in constraint programming (Q2489123) ‎ (← links)
• On the behavior of the homogeneous self-dual model for conic convex optimization (Q2492677) ‎ (← links)
• Solving semidefinite programming problems via alternating direction methods (Q2493944) ‎ (← links)
• Fast linear iterations for distributed averaging (Q2503645) ‎ (← links)
• Cuts for mixed 0-1 conic programming (Q2571004) ‎ (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) ‎ (← links)
• A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188) ‎ (← links)
• A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming (Q3413092) ‎ (← links)