Pages that link to "Item:Q4162403"
From MaRDI portal
The following pages link to Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization (Q4162403):
Displayed 27 items.
- A new direct search method based on separable fractional interpolation model (Q287849) (← links)
- A derivative-free algorithm for linearly constrained optimization problems (Q404515) (← links)
- On diagonally structured problems in unconstrained optimization using an inexact super Halley method (Q432797) (← links)
- Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (Q506441) (← links)
- A limited memory steepest descent method (Q715093) (← links)
- Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization (Q858748) (← links)
- A compact limited memory method for large scale unconstrained optimization (Q869145) (← links)
- On the limited memory BFGS method for large scale optimization (Q911463) (← links)
- An assessment of quasi-Newton sparse update techniques for nonlinear structural analysis (Q1153746) (← links)
- Bibliography on the evaluation of numerical software (Q1254823) (← links)
- A chordal preconditioner for large-scale optimization (Q1262220) (← links)
- Scaled optimal path trust-region algorithm (Q1306663) (← links)
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space (Q1657403) (← links)
- Steplength selection in gradient projection methods for box-constrained quadratic programs (Q2009551) (← links)
- Damped techniques for the limited memory BFGS method for large-scale optimization (Q2247912) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- On the steplength selection in gradient methods for unconstrained optimization (Q2422865) (← links)
- Backward Step Control for Global Newton-Type Methods (Q2788626) (← links)
- Truncated-Newton algorithms for large-scale unconstrained optimization (Q3037163) (← links)
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods (Q3324531) (← links)
- Optimization of unconstrained functions with sparse Hessian matrices—Quasi-Newton methods (Q3659547) (← links)
- QN-like variable storage conjugate gradients (Q3668748) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- On Variable-Metric Methods for Sparse Hessians (Q3859198) (← links)
- Spectral Properties of Barzilai--Borwein Rules in Solving Singly Linearly Constrained Optimization Problems Subject to Lower and Upper Bounds (Q5110558) (← links)
- (Q5860419) (← links)
- A Derivative-Free Nonlinear Least Squares Solver (Q6090756) (← links)