COL

swMATH4783MaRDI QIDQ16946FDOQ16946

Author name not available (Why is that?)

Cited In (75)

• Sums of squares based approximation algorithms for MAX-SAT
• Title not available (Why is that?)
• LFTB: an efficient algorithm to bound linear fractional transformations
• Solving semidefinite programs using preconditioned conjugate gradients
• Mixed linear and semidefinite programming for combinatorial and quadratic optimization
• Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization problems
• A successive SDP-NSDP approach to a robust optimization problem in finance
• Semidefinite programming
• A matrix generation approach for eigenvalue optimization
• Semidefinite programming relaxations for the graph partitioning problem
• Fastest mixing Markov chain on graphs with symmetries
• An improved semidefinite programming relaxation for the satisfiability problem
• Block Coordinate Descent Methods for Semidefinite Programming
• Exploiting special structure in semidefinite programming: a survey of theory and applications
• Semidefinite programming for discrete optimization and matrix completion problems
• Semidefinite diagonal directions Monte Carlo algorithms for detecting necessary linear matrix inequality constraints
• Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
• Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• On semidefinite programming relaxations for the satisfiability problem
• Title not available (Why is that?)
• Solving large-scale semidefinite programs in parallel
• A computational study of a gradient-based log-barrier algorithm for a class of large-scale SDPs
• The Analytic Center Cutting Plane Method with Semidefinite Cuts
• Sum of squares method for sensor network localization
• Geometry of semidefinite Max-Cut relaxations via matrix ranks
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Stochastic second-order cone programming in mobile ad hoc networks
• An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
• A novel formulation of the max-cut problem and related algorithm
• Semidefinite programming relaxations for graph coloring and maximal clique problems
• Stochastic nuclear outages semidefinite relaxations
• An evaluation of semidefinite programming based approaches for discrete lot-sizing problems
• Fast linear iterations for distributed averaging
• A feasible method for optimization with orthogonality constraints
• An efficient method for convex constrained rank minimization problems based on DC programming
• Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
• Computational Approaches to Max-Cut
• Inexact non-interior continuation method for solving large-scale monotone SDCP
• Title not available (Why is that?)
• An ADMM-based interior-point method for large-scale linear programming
• A random attention and utility model
• An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
• A Spectral Bundle Method for Semidefinite Programming
• On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
• Discrete Transforms, Semidefinite Programming, and Sum-of-Squares Representations of Nonnegative Polynomials
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Lagrangian smoothing heuristics for Max-cut
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
• Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
• Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
• Relaxation and decomposition methods for mixed integer nonlinear programming.
• A projected gradient algorithm for solving the maxcut SDP relaxation
• A semidefinite programming approach to the quadratic knapsack problem
• Location-aided routing with uncertainty in mobile ad hoc networks: a stochastic semidefinite programming approach
• Efficient location area planning for cellular networks with hierarchical location databases
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A semidefinite programming approach to tensegrity theory and realizability of graphs
• Solving a class of semidefinite programs via nonlinear programming
• Discrete least-norm approximation by nonnegative (trigonometric) polynomials and rational functions
• Title not available (Why is that?)
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
• Dual versus primal-dual interior-point methods for linear and conic programming
• GMRES-Accelerated ADMM for Quadratic Objectives
• A semidefinite optimization approach for the single-row layout problem with unequal dimensions
• Advances in Linear Matrix Inequality Methods in Control
• Lagrangian Dual Interior-Point Methods for Semidefinite Programs
• Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
• Book drawings of complete bipartite graphs
• A guide to conic optimisation and its applications
• An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity
• 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
• An inexact dual logarithmic barrier method for solving sparse semidefinite programs

This page was built for software: COL