A general system for heuristic minimization of convex functions over non-convex sets
From MaRDI portal
Publication:4638917
DOI10.1080/10556788.2017.1304548zbMath1386.90182arXiv1601.07277OpenAlexW2607116528MaRDI QIDQ4638917
Reza Takapoui, Steven Diamond, Stephen P. Boyd
Publication date: 2 May 2018
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.07277
heuristicsnon-convex optimizationconvex approximationsalternating direction method of multipliersmodelling software
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Multicategory Angle-Based Learning for Estimating Optimal Dynamic Treatment Regimes With Censored Data, Online Mixed-Integer Optimization in Milliseconds, Tailored presolve techniques in branch‐and‐bound method for fast mixed‐integer optimal control applications, Alternating direction method of multipliers for truss topology optimization with limited number of nodes: a cardinality-constrained second-order cone programming approach, Tax-aware portfolio construction via convex optimization, Optimal representative sample weighting, Global optimality bounds for the placement of control valves in water supply networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On the linear convergence of the alternating direction method of multipliers
- A literature review on circle and sphere packing problems: models and methodologies
- An alternating direction algorithm for matrix completion with nonnegative factors
- Solving circle packing problems by global optimization: numerical results and industrial applications
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Laplacian matrices of graphs: A survey
- A branch and bound algorithm for the job-shop scheduling problem
- A polyhedral branch-and-cut approach to global optimization
- A circle packing algorithm
- A branch-and-cut method for 0-1 mixed convex programming
- Multiplier and gradient methods
- Experimental results on the crossover point in random 3-SAT
- Linear Models Based on Noisy Data and the Frisch Scheme
- CVXPY: A Python-Embedded Modeling Language for Convex Optimization
- MIMO PID tuning via iterated LMI restriction
- On convex relaxation of graph isomorphism
- Optimal Parameter Selection for the Alternating Direction Method of Multipliers (ADMM): Quadratic Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Large-Scale Portfolio Optimization
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Applications of the method of partial inverses to convex programming: Decomposition
- Eigenvalues of the Laplacian of a graph∗
- Identification of noisy systems
- An eigendecomposition approach to weighted graph matching problems
- Exact penalty functions in nonlinear programming
- A Branch and Bound Algorithm for Feature Subset Selection
- Algorithms for nonlinear constraints that use lagrangian functions
- An exact penalty function for nonlinear programming with inequalities
- A large database of graphs and its use for benchmarking graph isomorphism algorithms
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Nonconvex Splitting for Regularized Low-Rank + Sparse Decomposition
- Parallel Algorithms for Constrained Tensor Factorization via Alternating Direction Method of Multipliers
- Consensus-ADMM for General Quadratically Constrained Quadratic Programming
- Statement forNaval Research Logistics
- Exact Penalty Functions in Constrained Optimization
- Semidefinite Programming
- Diagonal and Low-Rank Matrix Decompositions, Correlation Matrices, and Ellipsoid Fitting
- Alternating direction method of multipliers for real and complex polynomial optimization models
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Online Object Tracking With Sparse Prototypes
- Solution of a Large-Scale Traveling-Salesman Problem
- Local Linear Convergence of the Alternating Direction Method of Multipliers on Quadratic or Linear Programs
- Branch-and-Bound Methods: A Survey
- The Packing of Equal Circles in a Square
- The elements of statistical learning. Data mining, inference, and prediction
