Discrete global descent method for discrete global optimization and nonlinear integer programming
From MaRDI portal
Recommendations
- A gradually descent method for discrete global optimization
- A discrete dynamic convexized method for nonlinear integer programming
- Global descent method for global optimization
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- A filled function method for finding a global minimizer on global integer optimization
Cites work
- scientific article; zbMATH DE number 3821078 (Why is no real title available?)
- scientific article; zbMATH DE number 1383429 (Why is no real title available?)
- A class of filled functions for finding global minimizers of a function of several variables
- A continuous approach to nonlinear integer programming
- A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
- A filled function method for finding a global minimizer of a function of several variables
- A new branching rule for the branch and bound algorithms for solving nonlinear integer programming problems
- A new filled function applied to global optimization.
- A new filled function method for global optimization
- An approximate algorithm for nonlinear integer programming
- Asymptotic strong duality for bounded integer programming: A logarithmic-exponential dual formulation
- Branch and Bound Experiments in Convex Nonlinear Integer Programming
- Discrete filled function method for discrete global optimization
- Filled functions for unconstrained global optimization.
- Finding global minima with a computable filled function.
- Integral global minimization: Algorithms, implementations and numerical tests
- More test examples for nonlinear programming codes
- Nonlinear integer programming
- On Descent from Local Minima
- Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method.
- Test examples for nonlinear programming codes
- Testing Unconstrained Optimization Software
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- \(p\)th power Lagrangian method for integer programming
Cited in
(19)- A note on ``A continuous approach to nonlinear integer programming
- Finding discrete global minima with a filled function for integer programming
- Fourier analysis and swarm intelligence for stochastic optimization of discrete functions
- Discrete global optimization problems with a modified discrete filled function
- An augmented filled function for global nonlinear integer optimization
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems
- Global descent method for global optimization
- A discrete dynamic convexized method for nonlinear integer programming
- An auxiliary function method for global minimization in integer programming
- Convergence of derivative-free nonmonotone direct search methods for unconstrained and box-constrained mixed-integer optimization
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- A novel convergent filled function algorithm for multi-dimensional global optimization
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- New tunnel-filled function method for discrete global optimization
- Identifying a global optimizer with filled function for nonlinear integer programming
- Minimal infeasible constraint sets in convex integer programs
- Towards global solutions of optimal discrete-valued control problems
- Parameter-free filled function method for nonlinear integer program
- A gradually descent method for discrete global optimization
This page was built for publication: Discrete global descent method for discrete global optimization and nonlinear integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878221)
