Marcos Raydan

Orcid: 0000-0003-0417-7981

According to our database1, Marcos Raydan authored at least 45 papers between 1993 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Derivative-free separable quadratic modeling and cubic regularization for unconstrained optimization.
4OR, March, 2024

An assessment of numerical and geometrical quality of bases on surface fitting on Powell-Sabin triangulations.
Math. Comput. Simul., 2024

2023
A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization.
Oper. Res. Forum, December, 2023

The max-out min-in problem: A tool for data analysis.
Comput. Oper. Res., June, 2023

2022
Using first-order information in direct multisearch for multiobjective optimization.
Optim. Methods Softw., 2022

A family of optimal weighted conjugate-gradient-type methods for strictly convex quadratic minimization.
Numer. Algorithms, 2022

An extended delayed weighted gradient algorithm for solving strongly convex optimization problems.
J. Comput. Appl. Math., 2022

2021
Properties of the delayed weighted gradient method.
Comput. Optim. Appl., 2021

Relationship between quality of basis for surface approximation and the effect of applying preconditioning strategies to their resulting linear systems.
Comput. Appl. Math., 2021

2020
A metaheuristic penalty approach for the starting point in nonlinear programming.
RAIRO Oper. Res., 2020

Geometrical inverse matrix approximation for least-squares problems and acceleration strategies.
Numer. Algorithms, 2020

Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization.
Comput. Optim. Appl., 2020

2019
Nonlinear Least-Squares Approach for Large-Scale Algebraic Riccati Equations.
SIAM J. Sci. Comput., 2019

2018
Conditional Gradient Method for Double-Convex Fractional Programming Matrix Problems.
J. Optim. Theory Appl., 2018

2017
Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization.
J. Glob. Optim., 2017

Nonsmooth spectral gradient methods for unconstrained optimization.
EURO J. Comput. Optim., 2017

2016
An acceleration scheme for Dykstra's algorithm.
Comput. Optim. Appl., 2016

Inverse-free recursive multiresolution algorithms for a data approximation problem.
Comput. Math. Appl., 2016

2015
Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization.
J. Glob. Optim., 2015

2014
Preconditioned conjugate gradient method for finding minimal energy surfaces on Powell-Sabin triangulations.
J. Comput. Appl. Math., 2014

2011
Convex constrained optimization for large-scale generalized Sylvester equations.
Comput. Optim. Appl., 2011

An implicit preconditioning strategy for large-scale generalized Sylvester equations.
Appl. Math. Comput., 2011

2010
Computing a Nearest Correlation Matrix with Factor Structure.
SIAM J. Matrix Anal. Appl., 2010

Residual algorithm for large-scale positive definite generalized eigenvalue problems.
Comput. Optim. Appl., 2010

Residual methods for the large-scale matrix pth root and some related problems.
Appl. Math. Comput., 2010

2009
Dykstra's Algorithm and Robust Stopping Criteria.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008
On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm.
Numer. Algorithms, 2008

2007
Spectral projected subgradient with a momentum term for the Lagrangean dual approach.
Comput. Oper. Res., 2007

Cauchy-Schwarz and Kantorovich type inequalities for scalar and matrix moment sequences.
Adv. Comput. Math., 2007

2006
Spectral residual method without gradient information for solving large-scale nonlinear systems of equations.
Math. Comput., 2006

2005
Robust Stopping Criteria for Dykstra's Algorithm.
SIAM J. Sci. Comput., 2005

2003
Nonmonotone spectral methods for large-scale nonlinear systems.
Optim. Methods Softw., 2003

Selective alternating projections to find the nearest SDD<sup>+</sup> matrix.
Appl. Math. Comput., 2003

2002
Primal and polar approach for computing the symmetric diagonally dominant projection.
Numer. Linear Algebra Appl., 2002

Spectral Variants of Krylov Subspace Methods.
Numer. Algorithms, 2002

Preconditioned Spectral Gradient Method.
Numer. Algorithms, 2002

Relaxed Steepest Descent and Cauchy-Barzilai-Borwein Method.
Comput. Optim. Appl., 2002

2001
Algorithm 813: SPG - Software for Convex-Constrained Optimization.
ACM Trans. Math. Softw., 2001

2000
Nonmonotone Spectral Projected Gradient Methods on Convex Sets.
SIAM J. Optim., 2000

1998
Computing the nearest diagonally dominant matrix.
Numer. Linear Algebra Appl., 1998

1997
The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem.
SIAM J. Optim., 1997

1996
Dykstra's Algorithm for a Constrained Least-squares Matrix Problem.
Numer. Linear Algebra Appl., 1996

Preconditioned Barzilai-Borwein method for the numerical solution of partial differential equations.
Numer. Algorithms, 1996

1994
Preconditioners for Distance Matrix Algorithms.
J. Comput. Chem., 1994

1993
Molecular conformations from distance matrices.
J. Comput. Chem., 1993


  Loading...