The following pages link to Cheng-Xian Xu (Q425327):
Displaying 50 items.
- (Q186219) (redirect page) (← links)
- An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function (Q279269) (← links)
- Erratum to: A trust region method for solving semidefinite programs (Q354632) (← links)
- A trust region method for solving semidefinite programs (Q354640) (← links)
- Robust portfolio selection involving options under a ``marginal+joint'' ellipsoidal uncertainty set (Q425328) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- A modified SLP algorithm and its global convergence (Q548334) (← links)
- Inexact non-interior continuation method for monotone semidefinite complementarity problems (Q694179) (← links)
- An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
- An excluding algorithm for testing whether a family of graphs are determined by their generalized spectra (Q852627) (← links)
- The \(T\)-shape tree is determined by its Laplacian spectrum (Q854855) (← links)
- A compact limited memory method for large scale unconstrained optimization (Q869145) (← links)
- The eigenvalue distribution on Schur complements of \(H\)-matrices (Q869933) (← links)
- A computational method for finding all the roots of a vector function (Q918635) (← links)
- A modified VNS metaheuristic for max-bisection problems (Q939544) (← links)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- Approximation algorithms for MAX RES CUT with limited unbalanced constraints (Q980434) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- Convergence of block iterative methods for linear systems with generalized \(H\)-matrices (Q1023310) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- Inexact non-interior continuation method for solving large-scale monotone SDCP (Q1044421) (← links)
- On the asymptotic behavior of graphs determined by their generalized spectra (Q1045144) (← links)
- (Q1108347) (redirect page) (← links)
- Tight bounds on the spectral radius of asymmetric nonnegative matrices (Q1108348) (← links)
- Hybrid method for nonlinear least-square problems without calculating derivatives (Q1123813) (← links)
- On finding a vertex solution using interior point methods (Q1174841) (← links)
- An optimal-basis identification technique for interior-point linear programming algorithms (Q1174842) (← links)
- Eigenvalues of centrosymmetric matrices (Q1195947) (← links)
- Generalized K-T conditions and penalty functions for quasidifferentiable programming (Q1288291) (← links)
- Trust region dogleg path algorithms for unconstrained minimization (Q1290213) (← links)
- (Q1306662) (redirect page) (← links)
- Scaled optimal path trust-region algorithm (Q1306663) (← links)
- A projected indefinite dogleg path method for equality constrained optimization (Q1307246) (← links)
- Sequential quadratic programming methods for optimal control problems with state constraints (Q1319141) (← links)
- Canonical forms for descriptor systems under restricted system equivalence (Q1360488) (← links)
- Robust performance of uncertain systems by output feedback (Q1363792) (← links)
- Gaussian pivoting method for solving linear complementarity problem (Q1377180) (← links)
- Filled functions for unconstrained global optimization (Q1589810) (← links)
- A hybrid method for solving variational inequality problems (Q1595268) (← links)
- Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity (Q1609646) (← links)
- A mixed 0--1 LP for index tracking problem with CVaR risk constraints (Q1761842) (← links)
- A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
- A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
- Convergence of Newton method in nonlinear network analysis (Q1804948) (← links)
- On a maximum principle for inverse monotone matrices (Q1805193) (← links)
- On an inverse eigenvalue problem for unitary Hessenberg matrices (Q1805209) (← links)
- Sign determinancy in \(LU\) factorization of \(P\)-matrices (Q1805318) (← links)
- Factorized updating methods for nonlinear least squares (Q1815613) (← links)
- Quadratic-programming criteria for copositive matrices (Q1823293) (← links)
- Numerical experience with a superfast real Toeplitz solver (Q1825588) (← links)
