Pages that link to "Item:Q911463"
From MaRDI portal
The following pages link to On the limited memory BFGS method for large scale optimization (Q911463):
Displaying 50 items.
- Learning AAM fitting through simulation (Q2270733) (← links)
- Sequential decision model for inference and prediction on nonuniform hypergraphs with application to knot matching from computational forestry (Q2281214) (← links)
- On efficiency of nonmonotone Armijo-type line searches (Q2284837) (← links)
- A deep energy method for finite deformation hyperelasticity (Q2292258) (← links)
- An improved Dai-Kou conjugate gradient algorithm for unconstrained optimization (Q2301132) (← links)
- Traction boundary conditions for molecular static simulations (Q2308596) (← links)
- Optimal multilevel randomized quasi-Monte-Carlo method for the stochastic drift-diffusion-Poisson system (Q2310184) (← links)
- Gradient-based optimization for regression in the functional tensor-train format (Q2312177) (← links)
- Neural network as a function approximator and its application in solving differential equations (Q2313205) (← links)
- Physics-informed neural networks: a deep learning framework for solving forward and inverse problems involving nonlinear partial differential equations (Q2314336) (← links)
- A new conjugate gradient method with an efficient memory structure (Q2322448) (← links)
- Representation of surfaces with normal cycles and application to surface registration (Q2331083) (← links)
- A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method (Q2338474) (← links)
- Limited memory BFGS method based on a high-order tensor model (Q2340525) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- Anisotropic and feature sensitive triangular remeshing using normal lifting (Q2352309) (← links)
- Fast methods for computing centroidal Voronoi tessellations (Q2355581) (← links)
- Inexact Hessian-vector products in reduced-space differential-equation constrained optimization (Q2357250) (← links)
- A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
- Forward-backward quasi-Newton methods for nonsmooth optimization problems (Q2364124) (← links)
- A time-parallel approach to strong-constraint four-dimensional variational data assimilation (Q2375090) (← links)
- Dissimilarity measures for population-based global optimization algorithms (Q2379686) (← links)
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization (Q2390003) (← links)
- An efficient three-dimensional adaptive quasicontinuum method using variable-node elements (Q2390431) (← links)
- On efficiently combining limited-memory and trust-region techniques (Q2398109) (← links)
- The modified accelerated Bregman method for regularized basis pursuit problem (Q2405606) (← links)
- Prediction of influenza peaks in Russian cities: comparing the accuracy of two SEIR models (Q2411060) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
- Inexact successive quadratic approximation for regularized optimization (Q2419525) (← links)
- Preconditioned nonlinear conjugate gradient methods based on a modified secant equation (Q2422866) (← links)
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search (Q2433993) (← links)
- Affinity-driven blog cascade analysis and prediction (Q2435723) (← links)
- A conjugate directions approach to improve the limited-memory BFGS method (Q2449186) (← links)
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization (Q2453471) (← links)
- Corrective feedback and persistent learning for information extraction (Q2457604) (← links)
- Semideterministic global optimization method: Application to a control problem of the Burgers equation (Q2483031) (← links)
- Markov logic networks (Q2491364) (← links)
- Spectral gradient projection method for solving nonlinear monotone equations (Q2503021) (← links)
- A subspace implementation of quasi-Newton trust region methods for unconstrained optimization (Q2503148) (← links)
- A constrained optimization algorithm for total energy minimization in electronic structure calculations (Q2508902) (← links)
- A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization (Q2514657) (← links)
- On rotation deformation zones for finite-strain Cosserat plasticity (Q2516733) (← links)
- Solving inverse problems involving the Navier--Stokes equations discretized by a Lagrange--Galerkin method (Q2573178) (← links)
- Shifted limited-memory variable metric methods for large-scale unconstrained optimization (Q2573468) (← links)
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem (Q2576724) (← links)
- A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
- An incomplete Hessian Newton minimization method and its application in a chemical database problem (Q2655407) (← links)
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations (Q2669649) (← links)
