Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • de/entity/Q5319479 2009-07-22 Paper Improved Newton's method with exact line searches to solve quadratic matrix equation 2008-11-18 Paper...
    10 bytes (17 words) - 20:09, 12 December 2023
  • A family of variable metric methods in function space, without exact line searches 1980-01-01 Paper https://portal.mardi4nfdi.de/entity/Q3917083 1979-01-01...
    10 bytes (18 words) - 05:39, 13 December 2023
  • 2002-07-11 Paper Minimization of extended quadratic functions with inexact line searches 1994-09-27 Paper...
    10 bytes (20 words) - 15:13, 13 December 2023
  • reverse convex programming problems by a sequence of linear programs and line searches 1990-01-01 Paper...
    10 bytes (18 words) - 12:34, 13 December 2023
  • descent (SQSD) method for unconstrained minimization with no explicit line searches 2001-11-12 Paper The determination of nonconvex workspaces of generally...
    10 bytes (18 words) - 09:55, 9 December 2023
  • Publication Date of Publication Type Nonmonotone line searches for unconstrained multiobjective optimization problems 2019-10-01 Paper...
    10 bytes (16 words) - 10:25, 25 September 2023
  • Publication Date of Publication Type A quasi-Newton method with Wolfe line searches for multiobjective optimization 2022-08-01 Paper...
    10 bytes (18 words) - 02:00, 25 September 2023
  • Publication Date of Publication Type Probabilistic Line Searches for Stochastic Optimization 2018-04-17 Paper...
    10 bytes (16 words) - 21:04, 26 December 2023
  • 1997-10-07 Paper Minimization of extended quadratic functions with inexact line searches 1994-09-27 Paper...
    10 bytes (20 words) - 17:36, 24 September 2023
  • 2020-01-21 Paper Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions 2019-01-14 Paper Block BFGS Methods 2018-05-18...
    10 bytes (16 words) - 00:52, 28 December 2023
  • stochastic non-negative associated gradient projection points using line searches 2021-04-28 Paper...
    10 bytes (16 words) - 23:38, 24 September 2023
  • 2012-01-27 Paper The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems 2011-02-25 Paper...
    10 bytes (17 words) - 13:49, 12 December 2023
  • Paper Conjugate gradient methods using quasi-Newton updates with inexact line searches 1990-01-01 Paper A primal-dual conjugate subgradient algorithm for specially...
    10 bytes (16 words) - 14:54, 28 January 2024
  • variations 2018-03-02 Paper On the nonmonotonicity degree of nonmonotone line searches 2018-02-15 Paper A necessary condition of Pontryagin type for fuzzy fractional...
    10 bytes (18 words) - 12:13, 11 December 2023
  • convergence of a class of collinear scaling algorithms with inexact line searches on convex functions 2000-02-01 Paper Coefficient control in a linear...
    10 bytes (16 words) - 21:36, 24 September 2023
  • stoichiometric matrix 2021-01-13 Paper On efficiency of nonmonotone Armijo-type line searches 2020-01-15 Paper A new restarting adaptive trust-region method for unconstrained...
    10 bytes (16 words) - 09:47, 6 October 2023
  • 2011-03-14 Paper The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems 2011-02-25 Paper...
    10 bytes (16 words) - 13:49, 12 December 2023
  • of nonlinear conjugate gradient coefficients with exact and inexact line searches 2019-03-18 Paper ANOTHER MODIFIED DPRP CONJUGATE GRADIENT METHOD WITH...
    10 bytes (16 words) - 18:20, 6 October 2023
  • arbitrary convex regions 2007-01-26 Paper The BFGS method with exact line searches fails for non-convex objective functions 2004-03-11 Paper The Affine...
    10 bytes (18 words) - 21:41, 9 December 2023
  • A generalized worst-case complexity analysis for non-monotone line searches 2021-05-31 Paper On inexact solution of auxiliary problems in tensor methods...
    10 bytes (18 words) - 12:52, 28 January 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)