Douglas Soares Gonçalves

Orcid: 0000-0002-8673-1319

According to our database1, Douglas Soares Gonçalves authored at least 37 papers between 2012 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A two-phase rank-based algorithm for low-rank matrix completion.
Optim. Lett., September, 2023

Nonmonotone feasible arc search algorithm for minimization on Stiefel manifold.
Comput. Appl. Math., June, 2023

First-order methods for the convex hull membership problem.
Eur. J. Oper. Res., 2023

Levenberg-Marquardt method with Singular Scaling and applications.
CoRR, 2023

2022
A two-phase rank-based Soft-Impute algorithm for low-rank matrix completion.
CoRR, 2022

A Distance Geometry Procedure Using the Levenberg-Marquardt Algorithm and with Applications in Biology but Not only.
Proceedings of the Bioinformatics and Biomedical Engineering, 2022

2021
Nonmonotone inexact restoration approach for minimization with orthogonality constraints.
Numer. Algorithms, 2021

Further results on latent discourse models and word embeddings.
J. Mach. Learn. Res., 2021

An inexact projected LM type algorithm for solving convex constrained nonlinear equations.
J. Comput. Appl. Math., 2021

Solving the One-dimensional Distance Geometry Problem by Optical Computing.
CoRR, 2021

Improving the sampling process in the interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem.
Appl. Math. Comput., 2021

A New Algorithm for the <sup>K</sup>DMDGP Subclass of Distance Geometry Problems with Exact Distances.
Algorithmica, 2021

2020
An integer programming approach for the search of discretization orders in distance geometry problems.
Optim. Lett., 2020

A least-squares approach for discretizable distance geometry problems with inexact distances.
Optim. Lett., 2020

A new algorithm for the <sup>K</sup>DMDGP subclass of Distance Geometry Problems.
CoRR, 2020

Non-monotone inexact restoration method for nonlinear programming.
Comput. Optim. Appl., 2020

MD-jeep: a New Release for Discretizable Distance Geometry Problems with Interval Data.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

2019
Local Convergence Analysis of the Levenberg-Marquardt Framework for Nonzero-Residue Nonlinear Least-Squares Problems Under an Error Bound Condition.
J. Optim. Theory Appl., 2019

Preface.
Discret. Appl. Math., 2019

A Coarse-Grained Representation for Discretizable Distance Geometry with Interval Data.
Proceedings of the Bioinformatics and Biomedical Engineering, 2019

2018
A symmetry-based splitting strategy for discretizable distance geometry problems.
J. Glob. Optim., 2018

Preface: Special issue dedicated to Distance Geometry.
J. Glob. Optim., 2018

Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures.
Ann. Oper. Res., 2018

2017
Recent advances on the interval distance geometry problem.
J. Glob. Optim., 2017

Normalized Euclidean distance matrices for human motion retargeting.
Proceedings of the Tenth International Conference on Motion in Games, 2017

An Approach to Dynamical Distance Geometry.
Proceedings of the Geometric Science of Information - Third International Conference, 2017

A Distance-Based Approach for Human Posture Simulations.
Proceedings of the 2017 Federated Conference on Computer Science and Information Systems, 2017

2016
A projected gradient method for optimization over density matrices.
Optim. Methods Softw., 2016

Local analysis of a spectral correction for the Gauss-Newton model applied to quadratic residual problems.
Numer. Algorithms, 2016

Optimal partial discretization orders for discretizable distance geometry.
Int. Trans. Oper. Res., 2016

Assigned and unassigned distance geometry: applications to biological molecules and nanostructures.
4OR, 2016

2014
Global convergence of diluted iterations in maximum-likelihood quantum tomography.
Quantum Inf. Comput., 2014

Discretization orders and efficient computation of cartesian coordinates for distance geometry.
Optim. Lett., 2014

An adaptive branching scheme for the Branch & Prune algorithm applied to Distance Geometry.
Proceedings of the 2014 Federated Conference on Computer Science and Information Systems, 2014

2013
Mathematical methods in quantum state tomography.
PhD thesis, 2013

Energy-based Pruning Devices for the BP Algorithm applied to Distance Geometry.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012
Local solutions of maximum likelihood estimation in quantum state tomography.
Quantum Inf. Comput., 2012


  Loading...