An algorithm for nonlinear optimization problems with binary variables
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1857672
- Solving nonlinear programming problems involving discrete, integer, and continuous variables
- A derivative-based algorithm for a particular class of mixed variable optimization problems
- A continuous approach to nonlinear integer programming
- A binarisation heuristic for non-convex quadratic programming with box constraints
Cites work
- scientific article; zbMATH DE number 1206370 (Why is no real title available?)
- scientific article; zbMATH DE number 1302172 (Why is no real title available?)
- scientific article; zbMATH DE number 1552036 (Why is no real title available?)
- scientific article; zbMATH DE number 1383429 (Why is no real title available?)
- scientific article; zbMATH DE number 1857672 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A continuous approach to nonlinear integer programming
- A global continuation algorithm for solving binary quadratic programming problems
- An exact penalty approach for solving a class of minimization problems with boolean variables
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Computing Modified Newton Directions Using a Partial Cholesky Factorization
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Constrained global optimization: algorithms and applications
- Construction of test problems in quadratic bivalent programming
- Global Continuation for Distance Geometry Problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Newton Methods for Large-Scale Linear Equality-Constrained Minimization
- Newton-type methods for unconstrained and linearly constrained optimization
- Topics in semidefinite and interior-point methods
- Truncated-Newton algorithms for large-scale unconstrained optimization
Cited in
(33)- An overview of MINLP algorithms and their implementation in Muriqui optimizer
- Reconstruction algorithm for unknown cavities via Feynman-Kac type formula
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- scientific article; zbMATH DE number 1857672 (Why is no real title available?)
- Continuous reformulations for zero-one programming problems
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- Integrality gap minimization heuristics for binary mixed integer nonlinear programming
- An augmented Lagrangian method for nonconvex composite optimization problems with nonlinear constraints
- Exact penalty functions for nonlinear integer programming problems
- Multi-stage optimization for periodic inspection planning of geo-distributed infrastructure systems
- A computational algorithm for a class of non-smooth optimal control problems arising in aquaculture operations
- Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
- LMI-based robust mixed-integer model predictive control for hybrid systems
- Continuous quadratic programming formulations of optimization problems on graphs
- A game-theoretic algorithm for non-linear single-path routing problems
- Continuous Approaches to the Unconstrained Binary Quadratic Problems
- Cascades and fluctuations in an economy with an endogenous production network
- Improved penalty algorithm for mixed integer PDE constrained optimization problems
- Using improved directions of negative curvature for the solution of bound-constrained nonconvex problems
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference
- Continuous representations and functional extensions in combinatorial optimization
- Estimation method for inverse problems with linear forward operator and its application to magnetization estimation from magnetic force microscopy images using deep learning
- Manifold relaxations for integer programming
- A polyhedral study of the static probabilistic lot-sizing problem
- scientific article; zbMATH DE number 3970524 (Why is no real title available?)
- scientific article; zbMATH DE number 3970525 (Why is no real title available?)
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- An exact penalty function method for nonlinear mixed discrete programming problems
- An exact penalty global optimization approach for mixed-integer programming problems
- Weighted optimization with thresholding for complete-case analysis
This page was built for publication: An algorithm for nonlinear optimization problems with binary variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711384)
