The following pages link to Hezhi Luo (Q820740):
Displaying 19 items.
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- On the characterization of preinvex functions (Q939110) (← links)
- Necessary optimality conditions for a class of nonsmooth vector optimization (Q1036898) (← links)
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods (Q1730782) (← links)
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation (Q1741128) (← links)
- Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization (Q2029687) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- On saddle points in semidefinite optimization via separation scheme (Q2346391) (← links)
- New methods for characterizing \(D\)-\(\eta\)-properly prequasi-invex functions (Q2369380) (← links)
- On characterizations of \(D\)-\(\eta\)-properly prequasi-invex function (Q2425846) (← links)
- Some results on augmented Lagrangians in constrained global optimization via image space analysis (Q2435019) (← links)
- On necessary conditions for a class of nondifferentiable minimax fractional programming (Q2480919) (← links)
- Remarks on criteria of prequasi-invex functions (Q2501449) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming (Q2636605) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection (Q6064034) (← links)
- An effective global algorithm for worst-case linear optimization under polyhedral uncertainty (Q6166102) (← links)
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints (Q6166654) (← links)