Pages that link to "Item:Q1162795"
From MaRDI portal
The following pages link to Partitioned variable metric updates for large structured optimization problems (Q1162795):
Displaying 41 items.
- ve08 (Q17281) (← links)
- Estimating reducible stochastic differential equations by conversion to a least-squares problem (Q159694) (← links)
- Analysis of sparse quasi-Newton updates with positive definite matrix completion (Q489095) (← links)
- Partitioned quasi-Newton methods for sparse nonlinear equations (Q523572) (← links)
- Approximating Hessians in unconstrained optimization arising from discretized problems (Q645548) (← links)
- Quasi-Newton methods for solving underdetermined nonlinear simultaneous equations (Q806959) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Approximate quasi-Newton methods (Q910338) (← links)
- On the limited memory BFGS method for large scale optimization (Q911463) (← links)
- Sparse quasi-Newton updates with positive definite matrix completion (Q930341) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients (Q1176574) (← links)
- Convergence of quasi-Newton matrices generated by the symmetric rank one update (Q1176575) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← 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)
- An implementation of Newton-like methods on nonlinearly constrained networks (Q1765533) (← links)
- A parallel computing scheme for minimizing a class of large scale functions (Q1822903) (← links)
- Local convergence analysis for partitioned quasi-Newton updates (Q1836466) (← links)
- An H-form variant of the partitioned QN method (Q1873167) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← links)
- A note on solving nonlinear optimization problems in variable precision (Q2191797) (← links)
- Optimization techniques for tree-structured nonlinear problems (Q2221477) (← links)
- A unified convergence framework for nonmonotone inexact decomposition methods (Q2301131) (← links)
- Solving reachability problems by a scalable constrained optimization method (Q2303529) (← links)
- Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems (Q2926061) (← links)
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization (Q3030592) (← links)
- (Q3057247) (← links)
- Dynamic scaling based preconditioning for truncated Newton methods in large scale unconstrained optimization (Q3369520) (← links)
- (Q3552458) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- (Q4039213) (← links)
- Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy<sup>∗</sup> (Q4378111) (← links)
- On efficient Hessian computation using the edge pushing algorithm in Julia (Q4685595) (← links)
- Optimization of large-scale complex systems (Q4723614) (← links)
- A class of diagonal preconditioners for limited memory BFGS method (Q4924122) (← links)
- On the existence of convex decompositions of partially separable functions (Q5186653) (← links)
- New limited memory bundle method for large-scale nonsmooth optimization (Q5460656) (← links)
- Optimizing partially separable functions without derivatives (Q5717536) (← links)
- Adjoint-based SQP method with block-wise quasi-Newton Jacobian updates for nonlinear optimal control (Q5865331) (← links)
