The following pages link to Cheng Lu (Q513159):
Displaying 50 items.
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints (Q513160) (← links)
- An improved lower bound and approximation algorithm for binary constrained quadratic programming problem (Q609569) (← links)
- Extended canonical duality and conic programming for solving 0-1 quadratic programming problems (Q620017) (← links)
- Nonconvex quadratic reformulations and solvable conditions for mixed integer quadratic programming problems (Q656459) (← links)
- Argument division based branch-and-bound algorithm for unit-modulus constrained complex quadratic programming (Q683728) (← links)
- (Q708174) (redirect page) (← links)
- Novel composite function solutions of the modified KdV equation (Q708176) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- Adaptive fractional order sliding mode controller with neural estimator (Q1661735) (← links)
- \(K\)-nearest neighbor intervals based AP clustering algorithm for large incomplete data (Q1665949) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints (Q2018510) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem (Q2031320) (← links)
- Fast computation of global solutions to the single-period unit commitment problem (Q2082175) (← links)
- Vectorial surrogate modeling method for multi-objective reliability design (Q2109665) (← links)
- Analyticity and time-decay rate of global solutions for the generalized MHD system near an equilibrium (Q2121431) (← links)
- A new greedy strategy for maximizing monotone submodular function under a cardinality constraint (Q2141724) (← links)
- A unified approach for a 1D generalized total variation problem (Q2149555) (← links)
- Maximizing a non-decreasing non-submodular function subject to various types of constraints (Q2154448) (← links)
- Globally solving extended trust region subproblems with two intersecting cuts (Q2228371) (← links)
- A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758) (← links)
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (Q2633541) (← links)
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem (Q2687676) (← links)
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters (Q2693785) (← links)
- A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612) (← links)
- (Q2928413) (← links)
- (Q3166199) (← links)
- Evaluation Approach to Rank Module Partition Schemes of Complex Products Based on Hybrid Fuzzy Multi-Attribute Decision Making (Q3175459) (← links)
- KKT Solution and Conic Relaxation for Solving Quadratically Constrained Quadratic Programming Problems (Q3225239) (← links)
- (Q3518121) (← links)
- Compact images of spaces with a weaker metric topology (Q3624927) (← links)
- (Q3642165) (← links)
- (Q4369972) (← links)
- A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems (Q4602345) (← links)
- An Efficient Global Algorithm for Single-Group Multicast Beamforming (Q4621755) (← links)
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection (Q4629340) (← links)
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems (Q4639134) (← links)
- (Q4812763) (← links)
- (Q4812766) (← links)
- Global Existence and Time-decay Rates of Solutions to 2D Magneto-micropolar Fluid Equations with Partial Viscosity (Q5075448) (← links)
- Adaptive computable approximation to cones of nonnegative quadratic functions (Q5169468) (← links)
- Efficient method for object contour extraction based on probability distribution image (Q5188925) (← links)
- Erratum: A Faster Algorithm Solving a Generalization of Isotonic Median Regression and a Class of Fused Lasso Problems (Q5222132) (← links)
- Hybrid Analog–Digital Antenna Array With Built-in Image Injection Calibration (Q5366637) (← links)
- (Q5453062) (← links)
- Computer Vision - ECCV 2004 (Q5713792) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions (Q6164960) (← links)
