The following pages link to (Q4209222):
Displaying 50 items.
- A variable neighborhood search based algorithm for finite-horizon Markov decision processes (Q613296) (← links)
- On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
- The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
- An iterative Lagrange method for the regularization of discrete ill-posed inverse problems (Q614354) (← links)
- Exact penalties for variational inequalities with applications to nonlinear complementarity problems (Q616794) (← links)
- \(\ell_{1}\)-penalization for mixture regression models (Q619141) (← links)
- On a global complexity bound of the Levenberg-marquardt method (Q620432) (← links)
- Convergence of a continuous approach for zero-one programming problems (Q621018) (← links)
- Competitive facility location problem with attractiveness adjustment of the follower: a bilevel programming model and its solution (Q621684) (← links)
- Regularized nonlinear least squares methods for hit position reconstruction in small gamma cameras (Q628919) (← links)
- Convex approximations to sparse PCA via Lagrangian duality (Q631218) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- A global piecewise smooth Newton method for fast large-scale model predictive control (Q644265) (← links)
- A BFGS trust-region method for nonlinear equations (Q644875) (← links)
- On the Lipschitz constant of the RSK correspondence (Q645961) (← links)
- Uzawa block relaxation domain decomposition method for the two-body contact problem with Tresca friction (Q653633) (← links)
- Quasi-Newton projection methods and the discrepancy principle in image restoration (Q654689) (← links)
- Discriminants and nonnegative polynomials (Q655567) (← links)
- Sensitivity analysis for frictional contact problems in the augmented Lagrangian formulation (Q658827) (← links)
- Continuation methods for approximate large scale object sequencing (Q669313) (← links)
- Damped Arrow-Hurwicz algorithm for sphere packing (Q680083) (← links)
- On a conjugate directions method for solving strictly convex QP problem (Q684136) (← links)
- Optimal switching between cash-flow streams (Q684138) (← links)
- Solution existence and stability of quadratically constrained convex quadratic programs (Q691471) (← links)
- Capacity optimization through sensing threshold adaptation for cognitive radio networks (Q694188) (← links)
- General-sum stochastic games: verifiability conditions for Nash equilibria (Q694841) (← links)
- Robust semidefinite programming problems with general nonlinear parameter dependence: approaches using the DC-representations (Q694844) (← links)
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints (Q704198) (← links)
- Benefit sharing in holding situations (Q707151) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- Approximate dynamic programming via direct search in the space of value function approximations (Q713118) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Microeconomics-based resource allocation in overlay networks by using non-strategic behavior modeling (Q718343) (← links)
- A smoothed NR neural network for solving nonlinear convex programs with second-order cone constraints (Q726145) (← links)
- New cyclic sparsity measures for deconvolution based on convex relaxation (Q736973) (← links)
- Fast global convergence of gradient methods for high-dimensional statistical recovery (Q741793) (← links)
- A globally and quadratically convergent algorithm with efficient implementation for unconstrained optimization (Q747220) (← links)
- Practical solution techniques for first-order MDPs (Q835833) (← links)
- A subgradient descent algorithm for optimization of initially controllable flow shop systems (Q839014) (← links)
- On a solution strategy for energy-based mesh optimization in finite hyperelastostatics (Q839233) (← links)
- An extension of the relaxation algorithm for solving a special case of capacitated arc routing problems (Q841604) (← links)
- An interior-point algorithm for computing equilibria in economies with incomplete asset markets (Q844604) (← links)
- The dynamic shortest path problem with anticipation (Q852944) (← links)
- An efficient algorithm for the least-squares reflexive solution of the matrix equation \(A_{1}XB_{1} = C_{1}, A_{2}XB_{2} = C_{2}\) (Q856077) (← links)
- Dynamic pricing of inventory/capacity with infrequent price changes (Q858397) (← links)
- A policy gradient method for semi-Markov decision processes with application to call admission control (Q859693) (← links)
- A generalized Kalman filter for fixed point approximation and efficient temporal-difference learning (Q859737) (← links)
- Computing light masks in neutral atom lithography (Q860316) (← links)
- The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
- A tensor product matrix approximation problem in quantum physics (Q861038) (← links)
