José Mario Martínez

According to our database1, José Mario Martínez authored at least 103 papers between 1980 and 2020.

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



In proceedings 
PhD thesis 




On the Complexity of an Inexact Restoration Method for Constrained Optimization.
SIAM J. Optim., 2020

Complexity and performance of an Augmented Lagrangian algorithm.
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

Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations.
CoRR, 2020

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

A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization.
Comput. Optim. Appl., 2019

On Regularization and Active-set Methods with Complexity for Constrained Optimization.
SIAM J. Optim., 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

On High-order Model Regularization for Constrained Optimization.
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

A nonlinear programming model with implicit variables for packing ellipsoids.
J. Glob. Optim., 2017

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

A Cone-Continuity Constraint Qualification and Algorithmic Consequences.
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

Packing ellipsoids by nonlinear optimization.
J. Glob. Optim., 2016

Preface to the Special Issue on Many Faces of Distances.
Int. Trans. Oper. Res., 2016

Feasibility problems with complementarity constraints.
Eur. J. Oper. Res., 2016

On the application of an Augmented Lagrangian algorithm to some portfolio problems.
EURO J. Comput. Optim., 2016

Sequential equality-constrained optimization for nonlinear programming.
Comput. Optim. Appl., 2016

A Flexible Inexact-Restoration Method for Constrained Optimization.
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

Assessing the reliability of general-purpose Inexact Restoration methods.
J. Comput. Appl. Math., 2015

Optimality properties of an Augmented Lagrangian method on infeasible problems.
Comput. Optim. Appl., 2015

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

Practical augmented Lagrangian methods for constrained optimization.
Fundamentals of algorithms 10, SIAM, ISBN: 978-1-611-97335-8, 2014

Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints.
SIAM J. Optim., 2013

Constrained derivative-free optimization on thin domains.
J. Glob. Optim., 2013

Packing circles within ellipses.
Int. Trans. Oper. Res., 2013

The boundedness of penalty parameters in an augmented Lagrangian method with constrained subproblems.
Optim. Methods Softw., 2012

Handling infeasibility in a large-scale nonlinear optimization algorithm.
Numer. Algorithms, 2012

Augmented Lagrangian method with nonmonotone penalty parameters for constrained optimization.
Comput. Optim. Appl., 2012

A projected-gradient interior-point algorithm for complementarity problems.
Numer. Algorithms, 2011

On the natural merit function for solving complementarity problems.
Math. Program., 2011

Outer Trust-Region Method for Constrained Optimization.
J. Optim. Theory Appl., 2011

Low order-value approach for solving VaR-constrained optimization problems.
J. Glob. Optim., 2011

Inexact restoration method for minimization problems arising in electronic structure calculations.
Comput. Optim. Appl., 2011

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

Marcos Raydan: Spectral Projected Gradient Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Practical Augmented Lagrangian Methods.
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

Low Order-Value Optimization and applications.
J. Glob. Optim., 2009

PACKMOL: A package for building initial configurations for molecular dynamics simulations.
J. Comput. Chem., 2009

Improving ultimate convergence of an augmented Lagrangian method.
Optim. Methods Softw., 2008

Continuous optimization methods for structure alignments.
Math. Program., 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

On Augmented Lagrangian Methods with General Lower-Level Constraints.
SIAM J. Optim., 2007

Convergent algorithms for protein structural alignment.
BMC Bioinform., 2007

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

Method of sentinels for packing items within arbitrary convex regions.
J. Oper. Res. Soc., 2006

Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization.
Comput. Oper. Res., 2006

Nonlinear-programming reformulation of the order-value optimization problem.
Math. Methods Oper. Res., 2005

Optimizing the packing of cylinders into a rectangular container: A nonlinear approach.
Eur. J. Oper. Res., 2005

Numerical Comparison of Augmented Lagrangian Algorithms for Nonconvex Problems.
Comput. Optim. Appl., 2005

Numer. Algorithms, 2004

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

Globally Convergent Inexact Quasi-Newton Methods for Solving Nonlinear Systems.
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

Minimization subproblems and heuristics for an applied clustering problem.
Eur. J. Oper. Res., 2003

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

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

On the solution of mathematical programming problems with equilibrium constraints.
Math. Methods Oper. Res., 2001

Nonmonotone Spectral Projected Gradient Methods on Convex Sets.
SIAM J. Optim., 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

Nonlinear programming algorithms using trust regions and augmented Lagrangians with nonmonotone penalty parameters.
Math. Program., 1999

Augmented lagrangians and sphere packing problems.
Int. J. Comput. Math., 1998

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

A trust region method for minimization of nonsmooth functions with linear constraints.
Math. Program., 1996

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

Discrimination by means of a trust region method.
Int. J. Comput. Math., 1995

Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres.
SIAM J. Optim., 1994

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

On the Maximization of a Concave Quadratic Function with Box Constraints.
SIAM J. Optim., 1994

Triangular Decomposition Methods for Solving Reducible Nonlinear Systems of Equations.
SIAM J. Optim., 1994

A parallel projection method for overdetermined nonlinear systems of equations.
Numer. Algorithms, 1993

Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations.
SIAM J. Sci. Comput., 1992

Parallel implementations of Broyden's method.
Computing, 1992

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

An algorithm for solving nonlinear least-squares problems with a new curvilinear search.
Computing, 1990

An algorithm for solving sparse Nonlinear Least Squares problems.
Computing, 1987

Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations.
Computing, 1987

Solution of nonlinear systems of equations by an optimal projection method.
Computing, 1986

A Quasi-Newton method with modification of one column per iteration.
Computing, 1984

Combination of the sequential secant method and Broyden's method with projected updates.
Computing, 1980