Entity usage

Showing below up to 50 results in range #1 to #50.

1. Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection: Label: en
2. Random-reshuffled SARAH does not need full gradient computations: Label: en
3. On constraint qualifications and optimality conditions for robust optimization problems through pseudo-differential: Label: en
4. An improved model for estimating optimal VRP solution values: Label: en
5. Exact QR factorizations of rectangular matrices: Label: en
6. Local convergence analysis of an inexact trust-region method for nonsmooth optimization: Label: en
7. Sample average approximation of conditional value-at-risk based variational inequalities: Label: en
8. Inexact generalized ADMM with relative error criteria for linearly constrained convex optimization problems: Label: en
9. On optimal universal first-order methods for minimizing heterogeneous sums: Label: en
10. Buffered and reduced multidimensional distribution functions and their application in optimization: Label: en
11. Randomized Lagrangian stochastic approximation for large-scale constrained stochastic Nash games: Label: en
12. On the complexity of proportionate open shop and job shop problems: Label: en
13. Checking weak and strong optimality of the solution to interval convex quadratic programming in a general form: Label: en
14. A best possible online algorithm for minimizing the total completion time and the total soft penalty cost: Label: en
15. Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties: Label: en
16. \(k\)-sparse vector recovery via truncated \(\ell_1 -\ell_2\) local minimization: Label: en
17. A local search algorithm for the \(k\)-path partition problem: Label: en
18. Pooling adjacent violators under interval constraints: Label: en
19. A parallel greedy approach enhanced by genetic algorithm for the stochastic rig routing problem: Label: en
20. Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms: Label: en
21. Worst-case evaluation complexity of a derivative-free quadratic regularization method: Label: en
22. The operator splitting schemes revisited: primal-dual gap and degeneracy reduction by a unified analysis: Label: en
23. Local linear convergence of proximal coordinate descent algorithm: Label: en
24. An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials: Label: en
25. Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems: Label: en
26. A clustering heuristic to improve a derivative-free algorithm for nonsmooth optimization: Label: en
27. Uniqueness of solutions in multivariate Chebyshev approximation problems: Label: en
28. Linear-size formulations for connected planar graph partitioning and political districting: Label: en
29. The set partitioning problem in a quantum context: Label: en
30. A robust model for the lot-sizing problem with uncertain demands: Label: en
31. On a new simple algorithm to compute the resolvents: Label: en
32. Streaming algorithms for maximizing the difference of submodular functions and the sum of submodular and supermodular functions: Label: en
33. Pareto efficiency without topology: Label: en
34. Log-domain interior-point methods for convex quadratic programming: Label: en
35. A generalized Frank-Wolfe method with ``dual averaging for strongly convex composite optimization: Label: en
36. Connectedness of the solution sets in generalized semi-infinite set optimization: Label: en
37. A strict complementarity approach to error bound and sensitivity of solution of conic programs: Label: en
38. On linear algebraic algorithms for the subgraph matching problem and its variants: Label: en
39. On a threshold descent method for quasi-equilibria: Label: en
40. Nicely structured positive bases with maximal cosine measure: Label: en
41. Existence of the least element solution of the vertical block \(Z\)-tensor complementarity problem: Label: en
42. A two-phase rank-based algorithm for low-rank matrix completion: Label: en
43. On the new modulus-based matrix splitting method for linear complementarity problem of \(H_+\)-matrix: Label: en
44. Regularized quasi-monotone method for stochastic optimization: Label: en
45. Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B: Label: en
46. A polytime preprocess algorithm for the maximum independent set problem: Label: en
47. The semiproximal SVM approach for multiple instance learning: a kernel-based computational study: Label: en
48. Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations: Label: en
49. Robust feasibility of systems of quadratic equations using topological degree theory: Label: en
50. A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems: Label: en