Solutions to quadratic minimization problems with box and integer constraints
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- scientific article; zbMATH DE number 221928 (Why is no real title available?)
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- A differentiable exact penalty function for bound constrained quadratic programming problems
- A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
- A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
- Canonical dual approach to solving 0-1 quadratic programming problems
- Canonical dual least square method for solving general nonlinear systems of quadratic equations
- Canonical dual transformation method and generalized triality theory in nonsmooth global optimization
- Canonical duality theory and solutions to constrained nonconvex quadratic programming
- Canonical duality theory: connections between nonconvex mechanics and global optimization
- Checking local optimality in constrained quadratic programming is NP- hard
- Computational experience with a new class of convex underestimators: Box-constrained NLP problems
- Convex Analysis
- Duality, triality and complementary extremum principles in non-convex parametric variational problems with applications
- Geometric nonlinearity: potential energy, complementary energy, and the gap function
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Lipschitzian optimization without the Lipschitz constant
- Multiple solutions to non-convex variational problems with implications for phase transitions and numerical computation
- Multi‐Duality in Minimal Surface—Type Problems
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
- On dual configurational forces
- Perfect duality theory and complete solutions to a class of global optimization problems*
- Primal-relaxed dual global optimization approach
- Quadratic programming with one negative eigenvalue is NP-hard
- Semidefinite optimization
- Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality
- Solutions and optimality criteria to box constrained nonconvex minimization problems
- Some NP-complete problems in quadratic and nonlinear programming
- Une caractérisation complete des minima locaux en programmation quadratique
Cited in
(21)- Complete solutions to general box-constrained global optimization problems
- On modeling and global solutions for d.c. optimization problems by canonical duality theory
- Topology Optimization of Structures Using an Adaptive Element-Free Galerkin Method
- The unconstrained binary quadratic programming problem: a survey
- Canonical dual solutions for fixed cost quadratic programs
- Solving the canonical dual of box- and integer-constrained nonconvex quadratic programs via a deterministic direct search algorithm
- Solution to nonconvex quadratic programming with both inequality and box constraints
- Canonical duality-triality theory: unified understanding for modeling, problems, and NP-hardness in global optimization of multi-scale systems
- 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
- Global extremal conditions for multi-integer quadratic programming
- On modeling and complete solutions to general fixpoint problems in multi-scale systems with applications
- Canonical dual approach to solving the maximum cut problem
- A novel canonical duality theory for solving 3-D topology optimization problems
- A general solution to least squares problems with box constraints and its applications
- Topology optimization via sequential integer programming and canonical relaxation algorithm
- On quadratically constrained quadratic optimization problems and canonical duality theory
- On topology optimization and canonical duality method
- An exact penalty function method for nonlinear mixed discrete programming problems
- scientific article; zbMATH DE number 1874115 (Why is no real title available?)
- A canonical dual approach for solving linearly constrained quadratic programs
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)
