Research Grants 20/07421-5 - Otimização, Otimização contínua - BV FAPESP
Advanced search
Start date
Betweenand

Practical algorithms for continuous optimization

Abstract

This proposal deals with practical algorithms for continuous optimization problems in a very general context known as nonlinear conic programming. This framework encompasses some well-established research fields in continuous optimization, such as nonlinear programming, nonlinear second-order cone programming, and nonlinear semidefinite programming. Each of these fields carry countless applications. Our group is interested in developing new optimality conditions without the need of regularity assumptions in such a way as to provide stronger global convergence results for practical algorithms. We are also interested in the applications of such problems for developing tighter convex relaxations for structured non-convex problems such as quadratically constrained quadratic problems. (AU)

Articles published in Agência FAPESP Newsletter about the research grant:
More itemsLess items
Articles published in other media outlets ( ):
More itemsLess items
VEICULO: TITULO (DATA)
VEICULO: TITULO (DATA)

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
ARMIJO, NICOLAS F.; GOMEZ, WALTER; CONCHA, JUAN P.. On the exactness of a simple relaxation for the extended Celis-Dennis-Tapia subproblem. OPTIMIZATION, v. N/A, p. 26-pg., . (20/07421-5, 19/13096-2)

Please report errors in scientific publications list using this form.
X

Report errors in this page


Error details: