José Mario Martínez
Orcid: 0000-0003-3331-368X
According to our database1,
José Mario Martínez
authored at least 120 papers
between 1980 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
On csauthors.net:
Bibliography
2024
Numer. Algorithms, May, 2024
Comput. Appl. Math., February, 2024
2022
Secant Acceleration of Sequential Residual Methods for Solving Large-Scale Nonlinear Systems of Equations.
SIAM J. Numer. Anal., December, 2022
Optim. Methods Softw., 2022
Optim. Methods Softw., 2022
On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization.
J. Glob. Optim., 2022
Inexact restoration for derivative-free expensive function minimization and applications.
J. Comput. Appl. Math., 2022
Comput. Optim. Appl., 2022
Comput. Optim. Appl., 2022
Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients.
Comput. Optim. Appl., 2022
2021
An alternating direction method of multipliers for the eigenvalue complementarity problem.
Optim. Methods Softw., 2021
Accelerated derivative-free spectral residual method for nonlinear systems of equations.
CoRR, 2021
2020
SIAM J. Optim., 2020
Optim. Methods Softw., 2020
On the use of third-order models with fourth-order regularization for unconstrained optimization.
Optim. Lett., 2020
Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact.
Math. Comput., 2020
Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization.
Comput. Optim. Appl., 2020
2019
A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization.
Comput. Optim. Appl., 2019
2018
On Regularization and Active-set Methods with Complexity for Constrained Optimization.
SIAM J. Optim., 2018
Fast convergence of an inexact interior point method for horizontal complementarity problems.
Numer. Algorithms, 2018
Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization.
Math. Oper. Res., 2018
On the employment of inexact restoration for the minimization of functions whose evaluation is subject to errors.
Math. Comput., 2018
2017
SIAM J. Optim., 2017
The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization.
SIAM J. Optim., 2017
On the minimization of possibly discontinuous functions by means of pointwise approximations.
Optim. Lett., 2017
Worst-case evaluation complexity for unconstrained nonlinear optimization using high-order regularized models.
Math. Program., 2017
Cubic-regularization counterpart of a variable-norm trust-region method for unconstrained minimization.
J. Glob. Optim., 2017
J. Glob. Optim., 2017
Comput. Electron. Agric., 2017
2016
Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models.
SIAM J. Optim., 2016
SIAM J. Optim., 2016
An inexact restoration approach to optimization problems with multiobjective constraints under weighted-sum scalarization.
Optim. Lett., 2016
Newton's method may fail to recognize proximity to optimal points in constrained optimization.
Math. Program., 2016
Inexact Restoration approach for minimization with inexact evaluation of the objective function.
Math. Comput., 2016
Int. Trans. Oper. Res., 2016
EURO J. Comput. Optim., 2016
Comput. Optim. Appl., 2016
2015
On optimization strategies for parameter estimation in models governed by partial differential equations.
Math. Comput. Simul., 2015
J. Optim. Theory Appl., 2015
Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization.
J. Glob. Optim., 2015
J. Comput. Appl. Math., 2015
Comput. Optim. Appl., 2015
2014
On the behaviour of constrained optimization methods when Lagrange multipliers do not exist.
Optim. Methods Softw., 2014
Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming.
J. Glob. Optim., 2014
Fundamentals of algorithms 10, SIAM, ISBN: 978-1-611-97335-8, 2014
2013
SIAM J. Optim., 2013
2012
The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems.
Optim. Methods Softw., 2012
Numer. Algorithms, 2012
Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization.
Comput. Optim. Appl., 2012
2011
Numer. Algorithms, 2011
Math. Program., 2011
J. Glob. Optim., 2011
Inexact restoration method for minimization problems arising in electronic structure calculations.
Comput. Optim. Appl., 2011
2010
A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences.
SIAM J. Optim., 2010
Partial spectral projected gradient method with active-set strategy for linearly constrained optimization.
Numer. Algorithms, 2010
Global minimization using an Augmented Lagrangian method with variable lower-level constraints.
Math. Program., 2010
Addressing the greediness phenomenon in Nonlinear Programming by means of Proximal Augmented Lagrangians.
Comput. Optim. Appl., 2010
Second-order negative-curvature methods for box-constrained and general constrained optimization.
Comput. Optim. Appl., 2010
2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009
Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints.
SIAM J. Sci. Comput., 2009
PACKMOL: A package for building initial configurations for molecular dynamics simulations.
J. Comput. Chem., 2009
2008
Optim. Methods Softw., 2008
Augmented Lagrangian methods under the constant positive linear dependence constraint qualification.
Math. Program., 2008
Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization.
Comput. Optim. Appl., 2008
2007
SIAM J. Optim., 2007
2006
Spectral residual method without gradient information for solving large-scale nonlinear systems of equations.
Math. Comput., 2006
J. Oper. Res. Soc., 2006
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization.
Comput. Oper. Res., 2006
2005
Math. Methods Oper. Res., 2005
Optimizing the packing of cylinders into a rectangular container: A nonlinear approach.
Eur. J. Oper. Res., 2005
Comput. Optim. Appl., 2005
2004
2003
An increasing-angle property of the conjugate gradient method and the implementation of large-scale minimization algorithms with line searches.
Numer. Linear Algebra Appl., 2003
Numer. Algorithms, 2003
Order-Value Optimization: Formulation and solution by means of a primal cauchy method.
Math. Methods Oper. Res., 2003
Packing optimization for automated generation of complex system's initial configurations for molecular dynamics and docking.
J. Comput. Chem., 2003
Solution of Bounded Nonlinear Systems of Equations Using Homotopies with Inexact Restoration.
Int. J. Comput. Math., 2003
Eur. J. Oper. Res., 2003
2002
Large-Scale Active-Set Box-Constrained Optimization Method with Spectral Projected Gradients.
Comput. Optim. Appl., 2002
A Limited-Memory Multipoint Symmetric Secant Method for Bound Constrained Optimization.
Ann. Oper. Res., 2002
2001
ACM Trans. Math. Softw., 2001
Math. Methods Oper. Res., 2001
2000
Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems.
SIAM J. Optim., 2000
Validation of an Augmented Lagrangian Algorithm with a Gauss-Newton Hessian Approximation Using a Set of Hard-Spheres Problems.
Comput. Optim. Appl., 2000
1999
Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
Math. Program., 1999
1998
1997
Int. J. Comput. Math., 1997
1996
A trust region method for minimization of nonsmooth functions with linear constraints.
Math. Program., 1996
1995
J. Glob. Optim., 1995
1994
SIAM J. Optim., 1994
SIAM J. Optim., 1994
SIAM J. Optim., 1994
Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations.
SIAM J. Optim., 1994
1993
Numer. Algorithms, 1993
1992
SIAM J. Sci. Comput., 1992
1991
A Curvilinear Search Using Tridiagonal Secant Updates for Unconstrained Optimization.
SIAM J. Optim., 1991
A Numerically stable reduced-gradient type algorithm for solving large-scale linearly constrained minimization problems.
Comput. Oper. Res., 1991
Parallel Block Triangular Decompositions for Solving Sparse Nonlinear Systems of Equations.
Proceedings of the Fifth SIAM Conference on Parallel Processing for Scientific Computing, 1991
1990
An algorithm for solving nonlinear least-squares problems with a new curvilinear search.
Computing, 1990
1987
Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations.
Computing, 1987
1986
Computing, 1986
1984
1980
Combination of the sequential secant method and Broyden's method with projected updates.
Computing, 1980