COL

swMATH4783MaRDI QIDQ16946

No author found.

Related Items (75)

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

This page was built for software: COL