The following pages link to Roummel F. Marcia (Q417599):
Displaying 26 items.
- Limited-memory BFGS systems with diagonal updates (Q417600) (← links)
- On solving large-scale limited-memory quasi-Newton equations (Q501277) (← links)
- On solving L-SR1 trust-region subproblems (Q513714) (← links)
- Multi-funnel optimization using Gaussian underestimation (Q946340) (← links)
- Convex quadratic approximation (Q1876590) (← links)
- Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints (Q2282813) (← links)
- A dense initialization for limited-memory quasi-Newton methods (Q2322555) (← links)
- On solving sparse symmetric linear systems whose definiteness is unknown (Q2480942) (← links)
- Iterative convex quadratic approximation for global optimization in protein docking (Q2490366) (← links)
- A backward stability analysis of diagonal pivoting methods for solving unsymmetric tridiagonal systems without interchanges (Q2889368) (← links)
- Shifted L-BFGS systems (Q2926066) (← links)
- Sequential Anomaly Detection in the Presence of Noise and Limited Feedback (Q2989863) (← links)
- (Q3107595) (← links)
- On Efficiently Computing the Eigenvalues of Limited-Memory Quasi-Newton Matrices (Q3195438) (← links)
- A pivoting strategy for symmetric tridiagonal matrices (Q3600010) (← links)
- A simplified pivoting strategy for symmetric tridiagonal matrices (Q3618025) (← links)
- Compact representation of the full Broyden class of quasi‐Newton updates (Q4558725) (← links)
- Compressed Sensing Performance Bounds Under Poisson Noise (Q4570422) (← links)
- Performance Bounds for Expander-Based Compressed Sensing in Poisson Noise (Q4573160) (← links)
- (Q4654841) (← links)
- Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation (Q5022491) (← links)
- Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations (Q5113710) (← links)
- Algorithm 943 (Q5270699) (← links)
- This is SPIRAL-TAP: Sparse Poisson Intensity Reconstruction ALgorithms—Theory and Practice (Q5370436) (← links)
- Global optimization in protein docking using clustering, underestimation and semidefinite programming (Q5437527) (← links)
- Computationally Efficient Decompositions of Oblique Projection Matrices (Q5853710) (← links)
