The following pages link to Yu-Hong Dai (Q457541):
Displaying 50 items.
- (Q171861) (redirect page) (← links)
- A smoothing SQP framework for a class of composite \(L_q\) minimization over polyhedron (Q304258) (← links)
- (Q341311) (redirect page) (← links)
- A Barzilai-Borwein conjugate gradient method (Q341313) (← links)
- A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
- Analysis of sparse quasi-Newton updates with positive definite matrix completion (Q489095) (← links)
- Convergence analysis of sparse quasi-Newton updates with positive definite matrix completion for two-dimensional functions (Q550506) (← links)
- (Q551770) (redirect page) (← links)
- A class of globally convergent conjugate gradient methods (Q551772) (← links)
- On restart procedures for the conjugate gradient method (Q596670) (← links)
- Sparse two-sided rank-one updates for nonlinear equations (Q625916) (← links)
- A sparse enhanced indexation model with chance and cardinality constraints (Q683716) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- A nonmonotone conjugate gradient algorithm for unconstrained optimization (Q698402) (← links)
- A framework of constraint preserving update schemes for optimization on Stiefel manifold (Q747775) (← links)
- A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- On nonmonotone Chambolle gradient projection algorithms for total variation image restoration (Q993545) (← links)
- Convergence properties of the Beale-Powell restart algorithm (Q1286637) (← links)
- Modified two-point stepsize gradient methods for unconstrained optimization (Q1610315) (← links)
- Conjugate gradient methods with Armijo-type line searches. (Q1611089) (← links)
- Alternating projection method for a class of tensor equations (Q1624670) (← links)
- A time-delay neural network model for unconstrained nonconvex optimization (Q1627490) (← links)
- Complexity analysis and algorithm design of pooling problem (Q1660293) (← links)
- A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
- An adaptive Lagrangian algorithm for optimal portfolio deleveraging with cross-impact (Q1697674) (← links)
- Efficient projected gradient methods for cardinality constrained optimization (Q1729947) (← links)
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming (Q1770257) (← links)
- Analysis of monotone gradient methods (Q1780127) (← links)
- New stochastic approximation algorithms with adaptive step sizes (Q1926628) (← links)
- A perfect example for the BFGS method (Q1949264) (← links)
- Global convergence of the method of shortest residuals (Q1964048) (← links)
- Further insight into the convergence of the Fletcher-Reeves method (Q1974184) (← links)
- Stochastic variance reduced gradient methods using a trust-region-like scheme (Q1995995) (← links)
- Fast algorithms for sparse portfolio selection considering industries and investment styles (Q2022191) (← links)
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
- On the asymptotic convergence and acceleration of gradient methods (Q2053340) (← links)
- Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization (Q2086938) (← links)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
- On the acceleration of the Barzilai-Borwein method (Q2114827) (← links)
- Sufficient conditions for existence of global minimizers of functions on Hilbert spaces (Q2162518) (← links)
- A penalty-free method with superlinear convergence for equality constrained optimization (Q2191791) (← links)
- On sparse beamformer design with reverberation (Q2295315) (← links)
- A family of spectral gradient methods for optimization (Q2322552) (← links)
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization (Q2346397) (← links)
- On the asymptotic behaviour of some new gradient methods (Q2487845) (← links)
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
- A new gradient method with an optimal stepsize property (Q2506170) (← links)
- Barzilai-Borwein-like methods for the extreme eigenvalue problem (Q2514702) (← links)
- An active set Newton-CG method for \(\ell_1\) optimization (Q2659721) (← links)
