Go to:
Logótipo
Comuta visibilidade da coluna esquerda
Você está em: Start > Publications > View > Minimization of a Concave Quadratic Function Subject to Box Constraints
Publication

Publications

Minimization of a Concave Quadratic Function Subject to Box Constraints

Title
Minimization of a Concave Quadratic Function Subject to Box Constraints
Type
Article in International Scientific Journal
Year
1994
Authors
Ana Maria Faustino
(Author)
FEUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications Without AUTHENTICUS Without ORCID
J. Júdice
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
Scientific classification
FOS: Natural sciences > Mathematics
Other information
Resumo (PT): We introduce a finite algorithm (MINBCQP) for finding a stationary point of a concave quadratic programming problem subject to box constraint (BCQP).This algorithm can move from one stationary point into another one with lower objective function value, it is also able to fix some variables into one of the bounds. Because of its first property, the algorithm finds in general an approximate optimal solution ttat is in many cases a global minimum of the BCQP. The second feature reduces (sometimes dramatically) the size of the BCQP to be solved alter the application of the algorithm MINBCQP. It is known that a BCQP with a nonpositive matrix can be solved in polynomial-time by exploring its reduction into a minimum-cut problem. In this paper we show that the algorithm MlNBCQP is quite efficient to deal with this type of problems. We also propose a hybrid technique for finding a global minimum of a BCQP. In this scheme, the algorithm MINBCQP is first applied to fix some variables to one of the bounds and then the BCQP associated with the free variables is solved by the minimum cut approach. Computational experience with large-scale BCQPs shows that this hybrid procedure is quite suitable and performs better than other alternative techniques for this type of BCQPs.
Language: English
Type (Professor's evaluation): Scientific
No. of pages: 20
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same authors

Solution of the concave linear complementarity problem (1992)
Chapter or Part of a Book
J. Júdice; Ana Maria Faustino
Solution of large-scale convex quadratic programs by LEMKE'S method (1992)
Chapter or Part of a Book
J. Júdice; Ana Maria Faustino
The solution of the linear bilevel programming problem by using the linear complementarity problem (1988)
Article in National Scientific Journal
J. Júdice; Ana Maria Faustino
Principal pivoting algorithms for a concave generalized linear complementarity problem (1994)
Article in National Scientific Journal
Ana Maria Faustino; J. Júdice
An integer programming model for truss topology optimization (2006)
Article in National Scientific Journal
Ana Maria Faustino; J. Júdice; Isabel Martins Ribeiro; Afonso Serra Neves

See all (14)

Of the same journal

Recommend this page Top
Copyright 1996-2025 © Faculdade de Direito da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-10 at 11:23:11 | Privacy Policy | Personal Data Protection Policy | Whistleblowing