Pages that link to "Item:Q1176574"
From MaRDI portal
The following pages link to The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients (Q1176574):
Displaying 27 items.
- Partitioned quasi-Newton methods for sparse nonlinear equations (Q523572) (← links)
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems (Q625664) (← links)
- An adaptive scaled BFGS method for unconstrained optimization (Q684183) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- The equivalence of strict convexity and injectivity of the gradient in bounded level sets (Q1177236) (← links)
- Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization (Q1670017) (← links)
- A double parameter scaled BFGS method for unconstrained optimization (Q1677470) (← links)
- Global convergence of Schubert's method for solving sparse nonlinear equations (Q1722445) (← links)
- A partitioned PSB method for partially separable unconstrained optimization problems (Q1733684) (← links)
- A new modified BFGS method for unconstrained optimization problems (Q1993498) (← links)
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization (Q2007164) (← links)
- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems (Q2028038) (← links)
- The global convergence of the BFGS method with a modified WWP line search for nonconvex functions (Q2163462) (← links)
- Global convergence of a nonmonotone Broyden family method for nonconvex unconstrained minimization (Q2167421) (← links)
- Global convergence of a modified Broyden family method for nonconvex functions (Q2171116) (← links)
- The projection technique for two open problems of unconstrained optimization problems (Q2194129) (← links)
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search (Q2290291) (← links)
- The global convergence of a modified BFGS method for nonconvex functions (Q2402402) (← links)
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions (Q3055067) (← links)
- A globally convergent BFGS method for nonconvex minimization without line searches (Q3369523) (← links)
- A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence (Q4239757) (← links)
- Computation of exact gradients in distributed dynamic systems (Q4391288) (← links)
- (Q5151745) (← links)
- New BFGS method for unconstrained optimization problem based on modified Armijo line search (Q5413886) (← links)
- A modified BFGS method and its global convergence in nonconvex minimization (Q5936068) (← links)
- An adaptive projection BFGS method for nonconvex unconstrained optimization problems (Q6202792) (← links)