I. F. D. Oliveira

activity

20212026

collaborators

Showing 2021Show all

3 papers · 1 filter

math.OC2021

Efficient solvers for Armijo's backtracking problem

Ivo Fagundes David de Oliveira, Ricardo Hiroshi Caldeira Takahashi

Backtracking is an inexact line search procedure that selects the first value in a sequence $x_{0}, x_{0} β, x_{0} β^{2} ...$ that satisfies $g (x) \leq 0$ on $R_{+}$ with $g (x) \leq 0$ i…

cs.DS2021

Minmax-optimal list searching with $O (lo g_{2} lo g_{2} n)$ average cost

I. F. D. Oliveira, R. H. C. Takahashi

We find a searching method on ordered lists that surprisingly outperforms binary searching with respect to average query complexity while retaining minmax optimality. The method is…

math.OC2021

An incremental descent method for multi-objective optimization

I. F. D. Oliveira, R. H. C. Takahashi

Current state-of-the-art multi-objective optimization solvers, by computing gradients of all $m$ objective functions per iteration, produce after $k$ iterations a measure of proxim…

Efficient solvers for Armijo's backtracking problem

Minmax-optimal list searching with O(log2​log2​n) average cost

An incremental descent method for multi-objective optimization

Minmax-optimal list searching with $O (lo g_{2} lo g_{2} n)$ average cost