Solutions to quadratic minimization problems with box and integer constraints
From MaRDI portal
Publication:989896
DOI10.1007/S10898-009-9469-0zbMATH Open1222.90039OpenAlexW1965908168MaRDI QIDQ989896FDOQ989896
Authors: David Y. Gao, Ning Ruan 
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
Recommendations
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Canonical duality theory for solving nonconvex/discrete constrained global optimization problems
- Global optimal solution to quadratic discrete programming problem with inequality constraints
- Solution to nonconvex quadratic programming with both inequality and box constraints
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46) Integer programming (90C10)
Cites Work
- Convex Analysis
- Some NP-complete problems in quadratic and nonlinear programming
- Lipschitzian optimization without the Lipschitz constant
- Title not available (Why is that?)
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- Semidefinite optimization
- Title not available (Why is that?)
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Geometric nonlinearity: potential energy, complementary energy, and the gap function
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Canonical dual approach to solving 0-1 quadratic programming problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Primal-relaxed dual global optimization approach
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Multiple solutions to non-convex variational problems with implications for phase transitions and numerical computation
- On dual configurational forces
- Duality, triality and complementary extremum principles in non-convex parametric variational problems with applications
- Multi‐Duality in Minimal Surface—Type Problems
- Canonical dual least square method for solving general nonlinear systems of quadratic equations
- Une caractérisation complete des minima locaux en programmation quadratique
- Title not available (Why is that?)
- Checking local optimality in constrained quadratic programming is NP- hard
- A differentiable exact penalty function for bound constrained quadratic programming problems
Cited In (21)
- Topology Optimization of Structures Using an Adaptive Element-Free Galerkin Method
- Topology optimization via sequential integer programming and canonical relaxation algorithm
- Solution to nonconvex quadratic programming with both inequality and box constraints
- On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications
- On modeling and global solutions for d.c. optimization problems by canonical duality theory
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
- The unconstrained binary quadratic programming problem: a survey
- 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
- Title not available (Why is that?)
- A general solution to least squares problems with box constraints and its applications
- Global extremal conditions for multi-integer quadratic programming
- Canonical dual approach to solving the maximum cut problem
- A canonical dual approach for solving linearly constrained quadratic programs
- Canonical dual solutions for fixed cost quadratic programs
- 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
- An exact penalty function method for nonlinear mixed discrete programming problems
- On topology optimization and canonical duality method
This page was built for publication: Solutions to quadratic minimization problems with box and integer constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989896)
