Solutions to quadratic minimization problems with box and integer constraints
From MaRDI portal
Publication:989896
DOI10.1007/s10898-009-9469-0zbMath1222.90039OpenAlexW1965908168MaRDI QIDQ989896
Publication date: 23 August 2010
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-009-9469-0
Integer programming (90C10) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (14)
Global solutions to a class of CEC benchmark constrained optimization problems ⋮ Global solutions to nonconvex optimization of 4th-order polynomial and log-sum-exp functions ⋮ Topology Optimization of Structures Using an Adaptive Element-Free Galerkin Method ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ An exact penalty function method for nonlinear mixed discrete programming problems ⋮ Canonical Duality-Triality Theory: Unified Understanding for Modeling, Problems, and NP-Hardness in Global Optimization of Multi-Scale Systems ⋮ A Novel Canonical Duality Theory for Solving 3-D Topology Optimization Problems ⋮ Complete solutions to general box-constrained global optimization problems ⋮ On quadratically constrained quadratic optimization problems and canonical duality theory ⋮ On modeling and global solutions for d.c. optimization problems by canonical duality theory ⋮ On topology optimization and canonical duality method ⋮ Topology optimization via sequential integer programming and canonical relaxation algorithm ⋮ On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications ⋮ Canonical dual approach to solving the maximum cut problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Canonical dual least square method for solving general nonlinear systems of quadratic equations
- Canonical dual approach to solving 0-1 quadratic programming problems
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Checking local optimality in constrained quadratic programming is NP- hard
- Une caractérisation complete des minima locaux en programmation quadratique
- Quadratic programming with one negative eigenvalue is NP-hard
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- Primal-relaxed dual global optimization approach
- Lipschitzian optimization without the Lipschitz constant
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- On dual configurational forces
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Geometric nonlinearity: potential energy, complementary energy, and the gap function
- A differentiable exact penalty function for bound constrained quadratic programming problems
- Semidefinite optimization
- Canonical Duality Theory: Connections between Nonconvex Mechanics and Global Optimization
- Some NP-complete problems in quadratic and nonlinear programming
- Duality, triality and complementary extremum principles in non-convex parametric variational problems with applications
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Multi‐Duality in Minimal Surface—Type Problems
- Multiple solutions to non-convex variational problems with implications for phase transitions and numerical computation
- Convex Analysis
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
This page was built for publication: Solutions to quadratic minimization problems with box and integer constraints
