Pages that link to "Item:Q1322551"
From MaRDI portal
The following pages link to Representations of quasi-Newton matrices and their use in limited memory methods (Q1322551):
Displaying 50 items.
- Stabilized BFGS approximate Kalman filter (Q256092) (← links)
- A limited memory quasi-Newton trust-region method for box constrained optimization (Q269370) (← links)
- An inexact successive quadratic approximation method for L-1 regularized optimization (Q301652) (← links)
- Practical inexact proximal quasi-Newton method with global complexity analysis (Q344963) (← links)
- Adaptive sequencing of primal, dual, and design steps in simulation based optimization (Q404526) (← links)
- Limited-memory BFGS systems with diagonal updates (Q417600) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- On solving large-scale limited-memory quasi-Newton equations (Q501277) (← links)
- On solving L-SR1 trust-region subproblems (Q513714) (← links)
- A Riemannian subspace limited-memory SR1 trust region method (Q518140) (← links)
- An active set limited memory BFGS algorithm for bound constrained optimization (Q638888) (← links)
- Limited memory BFGS method with backtracking for symmetric nonlinear equations (Q646097) (← links)
- Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization (Q670492) (← links)
- A hybrid ODE-based method for unconstrained optimization problems (Q694546) (← links)
- Extra-updates criterion for the limited memory BFGS algorithm for large scale nonlinear optimization (Q700177) (← links)
- An efficient method for nonlinearly constrained networks (Q706946) (← links)
- A limited memory steepest descent method (Q715093) (← links)
- Testing different nonsmooth formulations of the Lennard-Jones potential in atomic clustering problems (Q727242) (← links)
- Impulse noise removal by an adaptive trust-region method (Q780152) (← links)
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming (Q833407) (← links)
- Globally convergent limited memory bundle method for large-scale nonsmooth optimization (Q868454) (← links)
- A compact limited memory method for large scale unconstrained optimization (Q869145) (← links)
- A new subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q870176) (← links)
- Determination of protein structure and dynamics combining immune algorithms and pattern search methods (Q884876) (← links)
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems (Q897051) (← links)
- Limited memory methods with improved symmetric rank-one updates and its applications on nonlinear image restoration (Q900587) (← links)
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization (Q929334) (← links)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization (Q955062) (← links)
- An active set quasi-Newton method with projected search for bound constrained minimization (Q980100) (← links)
- Preconditioned conjugate gradient algorithms for nonconvex problems with box constraints (Q985699) (← links)
- An SQP method for general nonlinear programs using only equality constrained subproblems (Q1290629) (← links)
- A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
- An unconstrained optimization technique for large-scale linearly constrained convex minimization problems (Q1337633) (← links)
- The linear algebra of block quasi-Newton algorithms (Q1344059) (← links)
- Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization (Q1582578) (← links)
- Variable metric methods for unconstrained optimization and nonlinear least squares (Q1593813) (← links)
- A new restarting adaptive trust-region method for unconstrained optimization (Q1689065) (← links)
- New diagonal bundle method for clustering problems in large data sets (Q1694910) (← links)
- A study of structure-exploiting SQP algorithms for an optimal control problem with coupled hyperbolic and ordinary differential equation constraints (Q1713287) (← links)
- A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions (Q1715789) (← links)
- A limited memory BFGS method for solving large-scale symmetric nonlinear equations (Q1724803) (← links)
- Improved constraint-aggregation methods (Q1737017) (← links)
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates (Q1744900) (← links)
- A new supermemory gradient method for unconstrained optimization problems (Q1758038) (← links)
- A new regularized quasi-Newton method for unconstrained optimization (Q1800450) (← links)
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
- On the use of piecewise linear models in nonlinear programming (Q1942276) (← links)
- A reduced-space line-search method for unconstrained optimization via random descent directions (Q2007776) (← links)
- A dual gradient-projection method for large-scale strictly convex quadratic problems (Q2012229) (← links)
