Pages that link to "Item:Q1836466"

The following pages link to Local convergence analysis for partitioned quasi-Newton updates (Q1836466):

Displaying 50 items.

• ve08 (Q17281) (← links)
• Superlinearly convergent exact penalty methods with projected structured secant updates for constrained nonlinear least squares (Q467412) (← links)
• A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables (Q488922) (← links)
• Analysis of sparse quasi-Newton updates with positive definite matrix completion (Q489095) (← links)
• Partitioned quasi-Newton methods for sparse nonlinear equations (Q523572) (← links)
• Difference Newton-like methods under weak continuity conditions (Q594543) (← links)
• A trust-region-based BFGS method with line search technique for symmetric nonlinear equations (Q606189) (← links)
• Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
• Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations (Q806959) (← links)
• A modified Broyden family algorithm with global convergence under a weak Wolfe-Powell line search for unconstrained nonconvex problems (Q831261) (← links)
• On large scale nonlinear network optimization (Q908858) (← links)
• On the limited memory BFGS method for large scale optimization (Q911463) (← links)
• Convergence acceleration of direct trajectory optimization using novel Hessian calculation methods (Q927222) (← links)
• The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (Q928232) (← links)
• The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions (Q939545) (← links)
• Recognizing underlying sparsity in optimization (Q1013977) (← links)
• A new backtracking inexact BFGS method for symmetric nonlinear equations (Q1031701) (← links)
• The convergence of matrices generated by rank-2 methods from the restricted \(\beta\)-class of Broyden (Q1056526) (← links)
• Convergence theory for the structured BFGS secant method with an application to nonlinear least squares (Q1103332) (← links)
• The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients (Q1176574) (← links)
• Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
• An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix (Q1694296) (← links)
• A partitioned PSB method for partially separable unconstrained optimization problems (Q1733684) (← links)
• A parallel quasi-Newton algorithm for unconstrained optimization (Q1895652) (← links)
• New results on superlinear convergence of classical quasi-Newton methods (Q2031938) (← links)
• Rates of superlinear convergence for classical quasi-Newton methods (Q2149549) (← links)
• The global convergence of the BFGS method with a modified WWP line search for nonconvex functions (Q2163462) (← links)
• The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique (Q2181683) (← 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)
• A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
• The global convergence of a modified BFGS method for nonconvex functions (Q2402402) (← links)
• A conjugate directions approach to improve the limited-memory BFGS method (Q2449186) (← links)
• The superlinear convergence of a new quasi-Newton-SQP method for constrained optimization (Q2479147) (← links)
• New quasi-Newton methods for unconstrained optimization problems (Q2493696) (← links)
• New line search methods for unconstrained optimization (Q2510603) (← links)
• A nonmonotone Broyden method for unconstrained optimization (Q2778682) (← links)
• A two-step superlinearly convergent projected structured BFGS method for constrained nonlinear least squares (Q2841158) (← links)
• A Broyden Class of Quasi-Newton Methods for Riemannian Optimization (Q2945125) (← links)
• Global convergence of the partitioned BFGS algorithm for convex partially separable optimization (Q3030592) (← links)
• (Q3203937) (← links)
• A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence (Q4239757) (← links)
• Local and<i>Q</i>-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡ (Q4327895) (← links)
• On the stable global convergence of particular quasi-newton-methods (Q4327964) (← links)
• Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗ (Q4378111) (← links)
• A Structured Quasi-Newton Algorithm for Optimizing with Incomplete Hessian Information (Q4634097) (← links)
• Block BFGS Methods (Q4641646) (← links)
• Quasi-Newton methods: superlinear convergence without line searches for self-concordant functions (Q4646680) (← links)
• On efficient Hessian computation using the edge pushing algorithm in Julia (Q4685595) (← links)
• On the existence of convex decompositions of partially separable functions (Q5186653) (← links)