Discrete dynamical system approaches for Boolean polynomial optimization
From MaRDI portal
Publication:2161551
DOI10.1007/s10915-022-01882-zzbMath1492.90088arXiv1912.10221OpenAlexW2995963362MaRDI QIDQ2161551
Yi-Shuai Niu, Roland Glowinski
Publication date: 4 August 2022
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.10221
Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonlinear programming (90C30) Combinatorial optimization (90C27) Boolean programming (90C09) PDEs in connection with mathematical programming (35Q90)
Related Items (max. 100)
A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-Boolean optimization
- SCIP: solving constraint integer programs
- Algorithms for the maximum satisfiability problem
- Valid inequalities for mixed integer linear programs
- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA
- Partitioning procedures for solving mixed-variables programming problems
- A family of embedded Runge-Kutta formulae
- Neural network methods in combinatorial optimization
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Laplacian eigenvalues and the maximum cut problem
- Cluster analysis and mathematical programming
- Semidefinite programming relaxations for semialgebraic problems
- The multidimensional 0-1 knapsack problem: an overview.
- Heuristics for cardinality constrained portfolio optimization
- Solving zero-one mixed integer programming problems using tabu search
- Future paths for integer programming and links to artificial intelligence
- BARON: A general purpose global optimization software package
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Splitting Methods in Communication, Imaging, Science, and Engineering
- A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
- Optimal Cardinality Constrained Portfolio Selection
- The MATLAB ODE Suite
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Outline of an algorithm for integer solutions to linear programs
- Branching and bounds tighteningtechniques for non-convex MINLP
- A DC Programming Approach for Mixed-Integer Linear Programs
- 50 Years of Integer Programming 1958-2008
- A Greedy Heuristic for the Set-Covering Problem
- Large Displacement Calculations of Flexible Pipelines by Finite Element and Nonlinear Programming Methods
- Modeling Brain Function
- Cones of Matrices and Set-Functions and 0–1 Optimization
- General Purpose Simulated Annealing
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Finding a Maximum Independent Set
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Reducibility among Combinatorial Problems
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Solution of a Large-Scale Traveling-Salesman Problem
- On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
- OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION
- Some methods of speeding up the convergence of iteration methods
- An Improved Implicit Enumeration Approach for Integer Programming
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Algorithms for the set covering problem
- DC programming approaches for discrete portfolio optimization under concave transaction costs
This page was built for publication: Discrete dynamical system approaches for Boolean polynomial optimization
