J. M. Mart�nez

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds 1991 Andrew R. Conn
Nicholas I. M. Gould
Philippe L. Toint
2
+ Practical Methods of Optimization 2009 R. Ian Fletcher
2
+ None 2002 F. Luengo
Marcos Raydan
W. Glunt
T. L. Hayden
1
+ PDF Chat Constrained Optimization and Lagrange Multiplier Methods 1982 Dimitri P. Bertsekas
1
+ Recent Developments in Algorithms and Software for Trust Region Methods 1983 Jorge J. Morè
1
+ On the Resolution of Linearly Constrained Convex Minimization Problems 1994 Ana Friedlander
J. M. Martı́nez
Sandra A. Santos
1
+ PDF Chat CUTE 1995 Ingrid Bongartz
Andrew R. Conn
Nicholas I. M. Gould
Philippe L. Toint
1
+ PDF Chat Nonlinear-programming reformulation of the order-value optimization problem 2005 R. Andreani
Cibele Dunder
J. M. Martı́nez
1
+ PDF Chat Nonmonotone Spectral Projected Gradient Methods on Convex Sets 2000 E. G. Birgin
J. M. Martı́nez
Marcos Raydan
1
+ PDF Chat Newton’s Method with a Model Trust Region Modification 1982 D. C. Sorensen
1
+ Algorithms for bound constrained quadratic programming problems 1989 Jorge J. Mor�
Gerardo Toraldo
1
+ A smooth method for the finite minimax problem 1993 Gianni Di Pillo
Luigi Grippo
Stefano Lucidi
1
+ A new trust region algorithm for bound constrained minimization 1994 Ana Friedlander
J. M. Mart�nez
Sandra A. Santos
1
+ Automatic differentiation and spectral projected gradient methods for optimal control problems 1998 E. G. Birgin
Yuri G. Evtusenko
1
+ The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem 1997 Marcos Raydan
1
+ Restricted optimization: a clue to a fast and accurate implementation of the Common Reflection Surface Stack method 1999 E. G. Birgin
Ricardo Biloti
Martin Tygel
Lúcio T. Santos
1
+ On the Solution of Large Quadratic Programming Problems with Bound Constraints 1991 Jorge J. Morè
Gerardo Toraldo
1
+ A Nonmonotone Line Search Technique for Newton’s Method 1986 Luigi Grippo
F. Lampariello
Stefano Lucidi
1
+ PDF Chat Testing a class of methods for solving minimization problems with simple bounds on the variables 1988 Andrew R. Conn
Nicholas I. M. Gould
Philippe L. Toint
1
+ PDF Chat On the Barzilai and Borwein choice of steplength for the gradient method 1993 Marcos Raydan
1
+ Robust regression using iteratively reweighted least-squares 1977 Paul W. Holland
Roy E. Welsch
1
+ On the Maximization of a Concave Quadratic Function with Box Constraints 1994 Ana Friedlander
J. M. Martı́nez
1
+ Numerical Methods for Unconstrained Optimization and Nonlinear Equations 1996 J. E. Dennis
Robert B. Schnabel
1
+ Two-Point Step Size Gradient Methods 1988 Jonathan Barzilai
Jonathan M. Borwein
1
+ Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds 1988 Andrew R. Conn
Nicholas I. M. Gould
Philippe L. Toint
1
+ User's Guide for FSQP Version 2.0 A Fortran Code for Solving Optimization Problems, Possibly Minimax, with General Inequality Constraints and Linear Equality Constraints, Generating Feasible Iterates 1990 Jiawu Zhou
A.L. Tits
1
+ CUTE: constrained and unconstrained testing environment 1993 Ingrid Bongartz
AR Conn
Nim Gould
Philippe L. Toint
1
+ SPG: Software for Convex-Constrained Optimization 2001 E. G. Birgin
J. M. Martı́nez
Marcos Raydan
1
+ None 2000 Zaulida Castillo
Debora Cores
Marcos Raydan
1
+ PDF Chat Nonmonotone Strategy for Minimization of Quadratics with Simple Constraints 2001 M. A. Diniz-Ehrhardt
Zdeněk Dostál
Márcia A. Gomes-Ruggiero
J. M. Martı́nez
Sandra A. Santos
1