The following pages link to ve08 (Q17281):
Displaying 50 items.
- Estimating reducible stochastic differential equations by conversion to a least-squares problem (Q159694) (← links)
- On per-iteration complexity of high order Chebyshev methods for sparse functions with banded Hessians (Q403098) (← links)
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method (Q432797) (← links)
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints (Q461441) (← 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)
- Approximating Hessians in unconstrained optimization arising from discretized problems (Q645548) (← links)
- Convergence analysis of a modified BFGS method on convex minimizations (Q711385) (← links)
- Reformulations for utilizing separability when solving convex MINLP problems (Q721170) (← 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)
- The two-stage recombination operator and its application to the multiobjective \(0/1\) knapsack problem: A comparative study (Q833551) (← 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)
- Sparse quasi-Newton updates with positive definite matrix completion (Q930341) (← links)
- The global and superlinear convergence of a new nonmonotone MBFGS algorithm on convex objective functions (Q939545) (← links)
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization (Q970585) (← links)
- Recognizing underlying sparsity in optimization (Q1013977) (← links)
- Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP (Q1024721) (← 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)
- Separation process optimization calculations (Q1099788) (← 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)
- Convergence of quasi-Newton matrices generated by the symmetric rank one update (Q1176575) (← links)
- Unconstrained duals to partially separable constrained programs (Q1196186) (← links)
- Corrected sequential linear programming for sparse minimax optimization (Q1338528) (← links)
- Recent progress in unconstrained nonlinear optimization without derivatives (Q1365064) (← 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)
- Global convergence of a class of collinear scaling algorithms with inexact line searches on convex functions (Q1818416) (← links)
- Automatic differentiation for solving nonlinear partial differential equations: an efficient operator overloading approach (Q1851002) (← links)
- An H-form variant of the partitioned QN method (Q1873167) (← links)
- Nonlinear model predictive control via feasibility-perturbed sequential quadratic programming (Q1876587) (← links)
- A parallel quasi-Newton algorithm for unconstrained optimization (Q1895652) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- Learning general sparse additive models from point queries in high dimensions (Q2007617) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- New results on superlinear convergence of classical quasi-Newton methods (Q2031938) (← links)
- Sparse semidefinite programs with guaranteed near-linear time complexity via dualized clique tree conversion (Q2039245) (← 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)
