The following pages link to Jiming Peng (Q319325):
Displaying 50 items.
- Optimal deleveraging with nonlinear temporary price impact (Q319326) (← links)
- Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
- A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties (Q494344) (← links)
- An efficient algorithm for maximal margin clustering (Q656840) (← links)
- Exact penalty functions for constrained minimization problems via regularized gap function for variational inequalities (Q868635) (← links)
- A new relaxation framework for quadratic assignment problems based on matrix splitting (Q977330) (← links)
- A confidence voting process for ranking problems based on support vector machines (Q1026549) (← links)
- (Q1292203) (redirect page) (← links)
- A simply constrained optimization reformulation of KKT systems arising from variational inequalities (Q1292204) (← links)
- Equivalence of variational inequality problems to unconstrained minimization (Q1366423) (← links)
- Efficiently solving total least squares with Tikhonov identical regularization (Q1639723) (← links)
- A Lagrangian search method for the \(P\)-median problem (Q1675643) (← 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)
- A new class of polynomial primal-dual methods for linear and semidefinite optimization (Q1848379) (← links)
- Self-regular functions and new search directions for linear and semidefinite optimization (Q1849264) (← links)
- Ensemble clustering using semidefinite programming with applications (Q1959572) (← links)
- A hybrid Newton method for solving the variational inequality problem via the D-gap function (Q1961985) (← links)
- A non-interior continuation method for generalized linear complementarity problems (Q1968796) (← links)
- Generalized median graphs and applications (Q2271138) (← links)
- Self-adaptive support vector machines: modelling and experiments (Q2271791) (← links)
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting (Q2515070) (← links)
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems (Q2706331) (← links)
- A Scaled Gauss--Newton Primal-Dual Search Direction for Semidefinite Optimization (Q2706359) (← links)
- (Q2773659) (← links)
- Estimating Bounds for Quadratic Assignment Problems Associated with Hamming and Manhattan Distance Matrices Based on Semidefinite Programming (Q3083337) (← links)
- New Analysis on Sparse Solutions to Random Standard Quadratic Optimization Problems and Extensions (Q3449456) (← links)
- (Q3515782) (← links)
- On Mehrotra-Type Predictor-Corrector Algorithms (Q3544266) (← links)
- (Q4252828) (← links)
- Global method for monotone variational inequality probelms on polyhedral sets (Q4338033) (← links)
- (Q4359729) (← links)
- Optimality Conditions for the Minimization of a Quadratic with Two Quadratic Constraints (Q4377569) (← links)
- (Q4382829) (← links)
- (Q4382889) (← links)
- (Q4382893) (← links)
- A dynamic large-update primal‐dual interior-point method for linear optimization (Q4405939) (← links)
- (Q4496018) (← links)
- A hybrid Josephy — Newton method for solving box constrained variational equality roblems via the D-gap function (Q4704691) (← links)
- (Q4762524) (← links)
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities (Q4785875) (← links)
- (Q4791754) (← links)
- Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties (Q4995064) (← links)
- Analytical Results and Efficient Algorithm for Optimal Portfolio Deleveraging with Market Impact (Q5166308) (← links)
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function (Q5317539) (← links)
- Approximating K‐means‐type Clustering via Semidefinite Programming (Q5444287) (← links)
- Computing and Combinatorics (Q5716987) (← links)
- New complexity analysis of the primal-dual Newton method for linear optimization (Q5933827) (← links)
- New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction (Q5949888) (← links)
- On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management (Q6092540) (← links)
