Sign Up to like & get
recommendations!
0
Published in 2021 at "BIT Numerical Mathematics"
DOI: 10.1007/s10543-021-00886-9
Abstract: In this article we address the problem of minimizing a strictly convex quadratic function using a novel iterative method. The new algorithm is based on the well-known Nesterov’s accelerated gradient method. At each iteration of…
read more here.
Keywords:
strictly convex;
accelerated minimal;
gradient method;
convex quadratic ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2024 at "Journal of Global Optimization"
DOI: 10.1007/s10898-024-01440-x
Abstract: We present a branch-and-bound method for multiobjective mixed-integer convex quadratic programs that computes a superset of efficient integer assignments and a coverage of the nondominated set. The method relies on outer approximations of the upper…
read more here.
Keywords:
mixed integer;
multiobjective mixed;
integer;
integer convex ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2019 at "Optimization Letters"
DOI: 10.1007/s11590-018-1337-8
Abstract: This paper proposes a new second-order cone programming (SOCP) relaxation for convex quadratic programs with linear complementarity constraints. The new SOCP relaxation is derived by exploiting the technique that two positive semidefinite matrices can be…
read more here.
Keywords:
relaxation;
linear complementarity;
socp relaxation;
complementarity constraints ... See more keywords
Sign Up to like & get
recommendations!
1
Published in 2019 at "Optimization"
DOI: 10.1080/02331934.2020.1683315
Abstract: WGSCO 2018, Workshop on Graph Spectra, Combinatorics and Optimizationwas successfully held in the University of Aveiro, Portugal, at the occasion of the 65th birthday of Professor Domingos M. Cardoso. The topics of the Workshop reflected…
read more here.
Keywords:
convex quadratic;
stability number;
graph;
optimization ... See more keywords
Sign Up to like & get
recommendations!
0
Published in 2025 at "IEEE Control Systems Letters"
DOI: 10.1109/lcsys.2025.3572417
Abstract: Gauss’s principle of least constraint transforms a dynamics problem into a pure minimization framework. We show that this minimization problem is a Strongly Convex Quadratic Programming (SCQP) problem whose necessary condition is Newton’s equation of…
read more here.
Keywords:
problem;
mechanics;
minimization;
incompressible flows ... See more keywords