| Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings |
32 |
| Note on the modified relaxation CQ algorithm for the split feasibility problem |
14 |
| Practical algorithm for stochastic optimal control problem about microbial fermentation in batch culture |
11 |
| The projection and contraction methods for finding common solutions to variational inequality problems |
8 |
| Characterizations of robust solution set of convex programs with uncertain data |
8 |
| Stochastic R0 tensors to stochastic tensor complementarity problems |
8 |
| Bi-objective dynamic optimization of a nonlinear time-delay system in microbial batch process |
7 |
| Optimized ellipse packings in regular polygons |
6 |
| Solving 0-1 semidefinite programs for distributionally robust allocation of surgery blocks |
6 |
| A hybrid iterated local search heuristic for the maximum weight independent set problem |
6 |
| A note on approximate Karush-Kuhn-Tucker conditions in locally Lipschitz multiobjective optimization |
6 |
| Improved scheme for selection of potentially optimal hyper-rectangles in DIRECT |
6 |
| Robust optimization of noisy blackbox problems using the Mesh Adaptive Direct Search algorithm |
6 |
| Weak sharp solutions of mixed variational inequalities in Banach spaces |
5 |
| A note on the forward-Douglas-Rachford splitting for monotone inclusion and convex optimization |
5 |
| An equivalent tensor equation to the tensor complementarity problem with positive semi-definite Z-tensor |
5 |
| Gradient-type penalty method with inertial effects for solving constrained convex optimization problems with smooth data |
5 |
| Complexities of four problems on two-agent scheduling |
5 |
| A new adaptive Barzilai and Borwein method for unconstrained optimization |
5 |
| On semicoercive sweeping process with velocity constraint |
5 |
| An efficient parameterized logarithmic kernel function for linear optimization |
5 |
| The Nelder-Mead simplex algorithm with perturbed centroid for high-dimensional function optimization |
5 |
| Positive definite and Gram tensor complementarity problems |
5 |
| An improved mixed-integer programming model for the double row layout of facilities |
5 |
| On the global exponential stability of a projected dynamical system for strongly pseudomonotone variational inequalities |
5 |
| Mixed-integer programming formulation of a data-driven solver in computational elasticity |
5 |
| Markov inequalities, Dubiner distance, norming meshes and polynomial optimization on convex bodies |
4 |
| An interior penalty method for a finite-dimensional linear complementarity problem in financial engineering |
4 |
| Distributionally robust chance constrained problem under interval distribution information |
4 |
| BPPLIB: a library for bin packing and cutting stock problems |
4 |
| Selection of a covariance function for a Gaussian random field aimed for modeling global optimization problems |
4 |
| Inverse max plus sum spanning tree problem under weighted l(1) norm by modifying the sum-cost vector |
4 |
| First order optimality conditions and steepest descent algorithm on orthogonal Stiefel manifolds |
3 |
| A note on total degree polynomial optimization by Chebyshev grids |
3 |
| A note on semicontinuity of the solution mapping for parametric set optimization problems |
3 |
| A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems |
3 |
| Multi-criteria approximation schemes for the resource constrained shortest path problem |
3 |
| Nesterov's smoothing technique and minimizing differences of convex functions for hierarchical clustering |
3 |
| Projected subgradient algorithms on systems of equilibrium problems |
3 |
| Packing a fixed number of identical circles in a circular container with circular prohibited areas |
3 |
| Controlled dynamic model with boundary-value problem of minimizing a sensitivity function |
3 |
| Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts |
3 |
| Continuity of approximate solution maps of primal and dual vector equilibrium problems |
3 |
| Globally optimized packings of non-uniform size spheres in R-d: a computational study |
3 |
| On scenario aggregation to approximate robust combinatorial optimization problems |
3 |
| Ratcheting with a bliss level of consumption |
2 |
| Essential stability of cooperative equilibria for population games |
2 |
| Convergence analysis of a nonmonotone projected gradient method for multiobjective optimization problems |
2 |
| A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints |
2 |
| Optimal online algorithms for MapReduce scheduling on two uniform machines |
2 |