Sandra A. Santos

Orcid: 0000-0002-6250-0137

Affiliations:
  • University of Campinas, Brazil


According to our database1, Sandra A. Santos authored at least 43 papers between 1994 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
On the Fulfillment of the Complementary Approximate Karush-Kuhn-Tucker Conditions and Algorithmic Applications.
J. Optim. Theory Appl., May, 2023

A primal nonsmooth reformulation for bilevel optimization problems.
Math. Program., April, 2023

2022
On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems.
Numer. Algorithms, 2022

2021
On Second-Order Optimality Conditions for Vector Optimization: Addendum.
J. Optim. Theory Appl., 2021

Inexact Newton combined approximations in the topology optimization of geometrically nonlinear elastic structures and compliant mechanisms.
CoRR, 2021

Unbiased Bregman-Risk Estimators: Application to Regularization Parameter Selection in Tomographic Image Reconstruction.
CoRR, 2021

2020
A New Sequential Optimality Condition for Constrained Nonsmooth Optimization.
SIAM J. Optim., 2020

On the use of third-order models with fourth-order regularization for unconstrained optimization.
Optim. Lett., 2020

Analysis of a New Sequential Optimality Condition Applied to Mathematical Programs with Equilibrium Constraints.
J. Optim. Theory Appl., 2020

Applying the pattern search implicit filtering algorithm for solving a noisy problem of parameter identification.
Comput. Optim. Appl., 2020

2019
A pattern search and implicit filtering algorithm for solving linearly constrained minimization problems with noisy objective functions.
Optim. Methods Softw., 2019

Bilevel optimization with a multiobjective problem in the lower level.
Numer. Algorithms, 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

Accelerating block coordinate descent methods with identification strategies.
Comput. Optim. Appl., 2019

2018
A fast gradient and function sampling method for finite-max functions.
Comput. Optim. Appl., 2018

2017
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models.
Math. Program., 2017

On the Local Convergence Analysis of the Gradient Sampling Method for Finite Max-Functions.
J. Optim. Theory Appl., 2017

2016
Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models.
SIAM J. Optim., 2016

On the differentiability check in gradient sampling methods.
Optim. Methods Softw., 2016

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

Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method.
Comput. Optim. Appl., 2016

2015
Fisher information distance: A geometrical reading.
Discret. Appl. Math., 2015

Algebraic rules for quadratic regularization of Newton's method.
Comput. Optim. Appl., 2015

2014
An inexact and nonmonotone proximal method for smooth unconstrained minimization.
J. Comput. Appl. Math., 2014

2011
On Second-Order Optimality Conditions for Vector Optimization.
J. Optim. Theory Appl., 2011

2010
A spectral updating for the method of moving asymptotes.
Optim. Methods Softw., 2010

2009
Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints.
SIAM J. Sci. Comput., 2009

Regularity Conditions in Differentiable Vector Optimization Revisited.
J. Optimization Theory and Applications, 2009

An inexact-restoration method for nonlinear bilevel programming problems.
Comput. Optim. Appl., 2009

2008
Algorithm 873:: LSTRS: MATLAB software for large-scale trust-region subproblems and regularization.
ACM Trans. Math. Softw., 2008

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

Box-constrained minimization reformulations of complementarity problems in second-order cones.
J. Glob. Optim., 2008

2005
Fisher information matrix and hyperbolic geometry.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

2003
Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints.
SIAM J. Optim., 2003

2002
On the Resolution of the Generalized Nonlinear Complementarity Problem.
SIAM J. Optim., 2002

Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Equality Constraints: Corrigendum and Addendum.
Comput. Optim. Appl., 2002

Preconditioning by Projectors in the Solution of Contact Problems: A Parallel Implementation.
Ann. Oper. Res., 2002

2001
A New Matrix-Free Algorithm for the Large-Scale Trust-Region Subproblem.
SIAM J. Optim., 2001

1999
Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Equality Constraints.
Comput. Optim. Appl., 1999

1997
A minimax method with application to the initial vector coding problem.
Int. J. Comput. Math., 1997

1995
A trust-region strategy for minimization on arbitrary domains.
Math. Program., 1995

Solution of linear complementarity problems using minimization with simple bounds.
J. Glob. Optim., 1995

1994
On the Resolution of Linearly Constrained Convex Minimization Problems.
SIAM J. Optim., 1994


  Loading...