Solution to nonconvex quadratic programming with both inequality and box constraints (Q833456): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Computational experience with a new class of convex underestimators: Box-constrained NLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panpenalty finite element programming for plastic limit analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality principles in nonconvex systems. Theory, methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical dual transformation method and generalized triality theory in nonsmooth global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical duality theory and solutions to constrained nonconvex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions and optimality criteria for nonconvex constrained global optimization problems with connections between canonical and Lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Checking local optimality in constrained quadratic programming is NP- hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems / rank
 
Normal rank

Revision as of 20:44, 1 July 2024

scientific article
Language Label Description Also known as
English
Solution to nonconvex quadratic programming with both inequality and box constraints
scientific article

    Statements

    Identifiers