COL

MaRDI QIDQ16946swMATHFDO

Official website http://www.stanford.edu/~yyye/Col.html

Cited in

(only showing first 100 items - show all)

• A feasible method for optimization with orthogonality constraints
• Stochastic second-order cone programming in mobile ad hoc networks
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• Inexact non-interior continuation method for solving large-scale monotone SDCP
• CSDP
• SDPLIB
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• SDPHA
• LFTB
• SDPA
• A semidefinite programming approach to the quadratic knapsack problem
• MAX-2-SAT
• Semidefinite programming
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• Geometry of semidefinite Max-Cut relaxations via matrix ranks
• SDPT3
• SDPpack
• DSDP5
• CHOMPACK
• QSDP
• SDPLR
• CirCut
• Max-AO
• PENSDP
• MAXDET
• SNLSDP
• LMITOOL
• SPARSE-QR
• lambda
• An improved semidefinite programming relaxation for the satisfiability problem
• An efficient method for convex constrained rank minimization problems based on DC programming
• PICOS
• Solving a class of semidefinite programs via nonlinear programming
• Efficient location area planning for cellular networks with hierarchical location databases
• SpeeDP
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
• Semidefinite programming relaxations for the graph partitioning problem
• SDPARA
• SBmethod
• NOA
• Outward rotations
• Bregman primal-dual first-order method and application to sparse semidefinite programming
• A relaxed interior point method for low-rank semidefinite programming problems with applications to matrix completion
• A novel formulation of the max-cut problem and related algorithm
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• An inexact dual logarithmic barrier method for solving sparse semidefinite programs
• On semidefinite programming relaxations for the satisfiability problem
• Relaxation and decomposition methods for mixed integer nonlinear programming.
• Book drawings of complete bipartite graphs
• Optspace
• LOLIB
• Dual versus primal-dual interior-point methods for linear and conic programming
• Lagrangian smoothing heuristics for Max-cut
• Fast linear iterations for distributed averaging
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
• SDPNAL+
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• LFTB: an efficient algorithm to bound linear fractional transformations
• A successive SDP-NSDP approach to a robust optimization problem in finance
• A random attention and utility model
• CYCLADES
• scientific article; zbMATH DE number 1664574 (Why is no real title available?)
• A projected gradient algorithm for solving the maxcut SDP relaxation
• Block coordinate descent methods for semidefinite programming
• Computational approaches to MAX-cut
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
• An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
• QETLAB
• Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
• Fastest mixing Markov chain on graphs with symmetries
• A semidefinite programming approach to tensegrity theory and realizability of graphs
• Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
• Stochastic nuclear outages semidefinite relaxations
• Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
• sdpt3r
• scientific article; zbMATH DE number 1302192 (Why is no real title available?)
• ADMM_QAP
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• scientific article; zbMATH DE number 1489802 (Why is no real title available?)
• Mixed linear and semidefinite programming for combinatorial and quadratic optimization
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• A Spectral Bundle Method for Semidefinite Programming
• scientific article; zbMATH DE number 1757960 (Why is no real title available?)
• GMRES-accelerated ADMM for quadratic objectives
• A guide to conic optimisation and its applications
• Advances in Linear Matrix Inequality Methods in Control
• Lagrangian Dual Interior-Point Methods for Semidefinite Programs
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• An ADMM-based interior-point method for large-scale linear programming
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
• An optimal-storage approach to semidefinite programming using approximate complementarity
• ramchoice
• Solving semidefinite programs using preconditioned conjugate gradients
• Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
• ABIP
• Robust optimization of sums of piecewise linear functions with application to inventory problems
• Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
• Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach

This page was built for software: COL