Pages that link to "Item:Q259107"
From MaRDI portal
The following pages link to Journal of the Operations Research Society of China (Q259107):
Displayed 50 items.
- Preface: Special issue on data-driven optimization models and algorithms (Q259108) (← links)
- PPA-like contraction methods for convex optimization: a framework using variational inequality approach (Q259109) (← links)
- On solutions of sparsity constrained optimization (Q259112) (← links)
- Entropy function-based algorithms for solving a class of nonconvex minimization problems (Q259115) (← links)
- A note on the complexity of proximal iterative hard thresholding algorithm (Q259117) (← links)
- A sequential regression model for big data with attributive explanatory variables (Q259121) (← links)
- A linear mixed integer programming model for \(N\)-vehicle exploration problem (Q259122) (← links)
- Nonparallel support vector machine based on one optimization problem for pattern recognition (Q259125) (← links)
- The first-order necessary conditions for sparsity constrained optimization (Q259127) (← links)
- Online learning over a decentralized network through ADMM (Q259131) (← links)
- Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem (Q259135) (← links)
- Approximation algorithms for stochastic combinatorial optimization problems (Q290321) (← links)
- Chain-to-chain competition under demand uncertainty (Q290324) (← links)
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function (Q290328) (← links)
- Reducing multivalued discrete variables in solving separable task assignment problems (Q290332) (← links)
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334) (← links)
- An explicit solution for a series and parallel queue with retrial, losses, and Bernoulli schedule (Q290336) (← links)
- Optimal control of nonlinear switched systems: computational methods and applications (Q384180) (← links)
- An approximation bound analysis for Lasserre's relaxation in multivariate polynomial optimization (Q384182) (← links)
- A note on Legendre-Fenchel conjugate of the product of two positive-definite quadratic forms (Q384183) (← links)
- An approximation algorithm for the risk-adjusted two-stage stochastic facility location problem with penalties (Q384185) (← links)
- On the eigenvalues of general sum-connectivity Laplacian matrix (Q384188) (← links)
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function (Q384190) (← links)
- Batch scheduling with deteriorating jobs to minimize the total completion time (Q384194) (← links)
- On the mixed minus domination in graphs (Q384196) (← links)
- Wiener index of graphs and their line graphs (Q384198) (← links)
- Computational complexity of a solution for directed graph cooperative games (Q384201) (← links)
- Analysis of stationary queue length distribution for Geo/T-IPH/1 queue (Q384203) (← links)
- Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
- A cone constrained convex program: structure and algorithms (Q384210) (← links)
- Recent advances in mathematical programming with semi-continuous variables and cardinality constraint (Q384213) (← links)
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions (Q384215) (← links)
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- A counter-example to a conjecture of Ben-Tal, Nemirovski and Roos (Q384218) (← links)
- An almost tight lower bound for the scheduling problem to meet two min-sum objectives (Q384219) (← links)
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
- A new analysis on the Barzilai-Borwein gradient method (Q457542) (← links)
- Conjugate decomposition and its applications (Q457544) (← links)
- Some upper bounds related with domination number (Q457547) (← links)
- New bounds for RIC in compressed sensing (Q457549) (← links)
- Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← links)
- Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
- Competitive communication spectrum economy and equilibrium (Q489089) (← links)
- Quadratic optimization over a second-order cone with linear equality constraints (Q489094) (← links)
- Analysis of sparse quasi-Newton updates with positive definite matrix completion (Q489095) (← links)
- Consensus proximal support vector machine for classification problems with sparse solutions (Q489099) (← links)
- An exact \(l_1\) exponential penalty function method for multiobjective optimization problems with exponential-type invexity (Q489100) (← links)
- A new objective penalty function approach for solving constrained minimax problems (Q489101) (← links)
- Hybrid flowshop scheduling with interstage job transportation (Q489104) (← links)
- On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)