A discrete dynamic convexized method for nonlinear integer programming

DOI10.1016/J.CAM.2008.01.023zbMATH Open1156.65065OpenAlexW1977854849MaRDI QIDQ953398FDOQ953398

Authors: Wenxing Zhu, Howard Fan 

Publication date: 20 November 2008

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2008.01.023

Recommendations

• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
• A filled function method for box constrained nonlinear integer programming
• A dynamic convexized method for nonconvex mixed integer nonlinear programming
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• An auxiliary function method for global minimization in integer programming

zbMATH Keywords

convergencealgorithmbox constrained nonlinear integer programmingconvexized methoddiscrete local minimizer

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Integer programming (90C10)

Cites Work

• A filled function method for finding a global minimizer of a function of several variables
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Integral global minimization: Algorithms, implementations and numerical tests
• A branch-and-bound algorithm for bound constrained optimization problems without derivatives
• A controlled random search technique incorporating the simulated annealing concept for solving integer and mixed integer global optimization problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• The globally convexized filled functions for global optimization
• The Tunneling Algorithm for the Global Minimization of Functions
• Title not available (Why is that?)
• General local search methods
• An efficient algorithm to solve integer-programming problems arising in system-reliability design
• Title not available (Why is that?)
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Discrete filled function method for discrete global optimization
• Methods of Nonlinear 0-1 Programming
• A new filled function method for nonlinear integer programming problem
• A filled function method for finding a global minimizer on global integer optimization
• A continuous approach to nonlinear integer programming
• A note on adapting methods for continuous global optimization to the discrete case
• An approximate algorithm for nonlinear integer programming
• An algorithm for indefinite integer quadratic programming
• On Minimizing Nonseparable Functions Defined on the Integers with an Inventory Application
• An approximate algorithm for nonlinear integer programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• An exact penalty function approach for nonlinear integer programming problems
• A branch and bound algorithm for solving separable convex integer programming problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• An integrated plant loading model with economies of scale and scope
• On the investigation of stochastic global optimization algorithms
• Using convex envelopes to solve the interactive fixed-charge linear programming problem
• A Monte-Carlo approach for 0-1 programming problems
• Title not available (Why is that?)
• Calculation of Investment Portfolios with Risk Free Borrowing and Lending
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (17)

• The auxiliary function method for resolving decision making problem
• An auxiliary function method for global minimization in integer programming
• Weighted differentiation composition operators from mixed-norm to Zygmund spaces
• Discrete global descent method for discrete global optimization and nonlinear integer programming
• An effective discrete dynamic convexized method for solving the winner determination problem
• A dynamic convexized method for nonconvex mixed integer nonlinear programming
• An interactive fuzzy satisficing method for multiobjective nonlinear integer programming problems with block-angular structures through genetic algorithms with decomposition procedures
• Nonlinear integer programming for various forms of constraints
• Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
• A discrete dynamic convexized method for VLSI circuit partitioning
• Title not available (Why is that?)
• Solving the weighted MAX-SAT problem using the dynamic convexized method
• A note on ``A continuous approach to nonlinear integer programming
• A discrete dynamic convexized method for the max-cut problem
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem
• A method for convex black-box integer global optimization
• Title not available (Why is that?)

This page was built for publication: A discrete dynamic convexized method for nonlinear integer programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q953398)