An algorithm for nonlinear optimization problems with binary variables
From MaRDI portal
Publication:711384
DOI10.1007/s10589-008-9218-1zbMath1200.90156MaRDI QIDQ711384
Publication date: 26 October 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9218-1
Related Items
Estimation method for inverse problems with linear forward operator and its application to magnetization estimation from magnetic force microscopy images using deep learning, A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference, LMI-based robust mixed-integer model predictive control for hybrid systems, An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions, Multi-stage optimization for periodic inspection planning of geo-distributed infrastructure systems, A game-theoretic algorithm for non-linear single-path routing problems, Manifold relaxations for integer programming, Continuous reformulations for zero-one programming problems, Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming, Continuous representations and functional extensions in combinatorial optimization, Integrality gap minimization heuristics for binary mixed integer nonlinear programming, Exact penalty functions for nonlinear integer programming problems, Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems, A polyhedral study of the static probabilistic lot-sizing problem, On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems, An exact penalty function method for nonlinear mixed discrete programming problems, An exact penalty global optimization approach for mixed-integer programming problems, Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem, Improved penalty algorithm for mixed integer PDE constrained optimization problems, An overview of MINLP algorithms and their implementation in Muriqui optimizer, Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation, Reconstruction algorithm for unknown cavities via Feynman-Kac type formula, A continuation approach for solving binary quadratic program based on a class of NCP-functions, A computational algorithm for a class of non-smooth optimal control problems arising in aquaculture operations, Continuous quadratic programming formulations of optimization problems on graphs, Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming, Continuous Approaches to the Unconstrained Binary Quadratic Problems, Weighted Optimization with Thresholding for Complete-Case Analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- A global continuation algorithm for solving binary quadratic programming problems
- Constrained global optimization: algorithms and applications
- Topics in semidefinite and interior-point methods
- A continuous approach to nonlinear integer programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Truncated-Newton algorithms for large-scale unconstrained optimization
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Newton-type methods for unconstrained and linearly constrained optimization
- Computing Modified Newton Directions Using a Partial Cholesky Factorization
- Construction of test problems in quadratic bivalent programming
- Global Continuation for Distance Geometry Problems
- Newton Methods for Large-Scale Linear Equality-Constrained Minimization
