An exact penalty function method for nonlinear mixed discrete programming problems
From MaRDI portal
Recommendations
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- A two‐step method for mixed‐integer nonlinear programming problems
- Exact penalty functions for nonlinear integer programming problems
- An exact penalty global optimization approach for mixed-integer programming problems
- Analysis and discussion of several penalty methods for MINLP
Cites work
- scientific article; zbMATH DE number 1552036 (Why is no real title available?)
- A Computational Study of Search Strategies for Mixed Integer Programming
- A new exact penalty function method for continuous inequality constrained optimization problems
- An algorithm for nonlinear optimization problems with binary variables
- Canonical dual approach to solving 0-1 quadratic programming problems
- Constrained global optimization: algorithms and applications
- Continuous approaches for solving discrete optimization problems
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
- Discrete filled function method for discrete global optimization
- Duality principles in nonconvex systems. Theory, methods and applications
- Exact penalty functions for nonlinear integer programming problems
- On implementation of computational algorithms for optimal design 1: Preliminary investigation
- Optimization and control of bilinear systems. Theory, algorithms, and applications
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
- Solutions to quadratic minimization problems with box and integer constraints
Cited in
(21)- Analysis and discussion of several penalty methods for MINLP
- On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems
- Dynamic optimization of dual-mode hybrid systems with state-dependent switching conditions
- Optimal control of impulsive switched systems with minimum subsystem durations
- A computational algorithm for a class of non-smooth optimal control problems arising in aquaculture operations
- A method for the mixed discrete non-linear problems by particle swarm optimization
- Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming
- A class of smooth continuity methods for mixed integer nonlinear programming
- An optimization method for solving mixed discrete-continuous programming problems
- ZFD formula \(4\mathrm{I}g\mathrm{SFD}\_\mathrm{Y}\) applied to future minimization
- A two‐step method for mixed‐integer nonlinear programming problems
- A continuous strategy to solve a class of mixed optimization problems
- A penalty method for a mixed nonlinear complementarity problem
- scientific article; zbMATH DE number 3936933 (Why is no real title available?)
- scientific article; zbMATH DE number 4027193 (Why is no real title available?)
- Optimal discrete-valued control computation
- scientific article; zbMATH DE number 1383421 (Why is no real title available?)
- Optimal switching for linear quadratic problem of switched systems in discrete time
- Firefly penalty-based algorithm for bound constrained mixed-integer nonlinear programming
- Translation, solving scheme, and implementation of a periodic and optimal impulsive state control problem
- An exact penalty global optimization approach for mixed-integer programming problems
This page was built for publication: An exact penalty function method for nonlinear mixed discrete programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1936789)
