Pages that link to "Item:Q4764307"

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

Displaying 50 items.

• Douglas-Rachford splitting method for semidefinite programming (Q295495) (← links)
• A linear-time algorithm for trust region problems (Q304248) (← links)
• An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
• A feasible primal-dual interior point method for linear semidefinite programming (Q329782) (← links)
• Sufficient conditions for global optimality of semidefinite optimization (Q371939) (← links)
• A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization (Q394386) (← links)
• Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
• Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
• A quantum characterization of NP (Q445251) (← links)
• Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
• An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization (Q520262) (← links)
• Extension of smoothing Newton algorithms to solve linear programming over symmetric cones (Q545466) (← links)
• A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs (Q554728) (← links)
• Polynomial time solvability of non-symmetric semidefinite programming (Q613324) (← links)
• Newton's method for computing the nearest correlation matrix with a simple upper bound (Q620444) (← links)
• Distance metric learning by minimal distance maximization (Q622006) (← links)
• Robust semidefinite relaxations for a quadratic OFDMA resource allocation scheme (Q632686) (← links)
• The \(Q\) method for symmetric cone programming (Q639204) (← links)
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION (Q679447) (← links)
• Optimality criteria without constraint qualifications for linear semidefinite problems (Q690528) (← 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)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• Conic mixed-integer rounding cuts (Q847842) (← links)
• \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← 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)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• Primal-dual interior-point algorithm for convex quadratic semi-definite optimization (Q923998) (← links)
• Semi-definite programming techniques for structured quadratic inverse eigenvalue problems (Q964207) (← links)
• Bandgap optimization of two-dimensional photonic crystals using semidefinite programming and subspace methods (Q969443) (← links)
• Decomposition-based method for sparse semidefinite relaxations of polynomial optimization problems (Q987509) (← links)
• Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
• Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds (Q1014028) (← links)
• A new primal-dual path-following interior-point algorithm for semidefinite optimization (Q1014697) (← links)
• Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
• Inexact non-interior continuation method for solving large-scale monotone SDCP (Q1044421) (← 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)