The following pages link to (Q4718793):
Displaying 50 items.
- A two-factor, stochastic programming model of Danish mortgage-backed securities (Q953639) (← links)
- The \(\ell_1\) solution of linear inequalities (Q959132) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- Klee sets and Chebyshev centers for the right Bregman distance (Q979041) (← links)
- The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets (Q999284) (← links)
- A primal-dual perspective of online learning algorithms (Q1009218) (← links)
- A hybrid algorithm for solving linear inequalities in a least squares sense (Q1014358) (← links)
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
- Bregman distances and Klee sets (Q1028402) (← links)
- Bregman distances and Chebyshev sets (Q1029105) (← links)
- A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems (Q1031700) (← links)
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin (Q1040681) (← links)
- Viscosity approximation methods for generalized equilibrium problems and fixed point problems with applications (Q1049485) (← links)
- Dynamic models for fixed-income portfolio management under uncertainty (Q1275033) (← links)
- Newton's method for linear inequality systems (Q1296136) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- A model for designing callable bonds and its solution using tabu search (Q1391445) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- Projection and proximal point methods: Convergence results and counterexamples. (Q1426419) (← links)
- Nonlinear proximal decomposition method for convex programming (Q1594877) (← links)
- Adaptive and self-confident on-line learning algorithms (Q1604218) (← links)
- Parallel interior-point method for linear and quadratic programs with special structure (Q1608140) (← links)
- A class of optimized row projection methods for solving large nonsymmetric linear systems (Q1612435) (← links)
- Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
- The combination projection method for solving convex feasibility problems (Q1634718) (← links)
- Supplementary projections for the acceleration of Kaczmarz algorithm (Q1646081) (← links)
- Some convergence strategies for the alternating generalized projection method (Q1653932) (← links)
- Constraint consensus methods for finding strictly feasible points of linear matrix inequalities (Q1659091) (← links)
- Adaptive block coordinate DIRECT algorithm (Q1685578) (← links)
- Convergence analysis of processes with valiant projection operators in Hilbert space (Q1706406) (← links)
- Survey on distance metric learning and dimensionality reduction in data mining (Q1711231) (← links)
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems (Q1713205) (← links)
- Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces (Q1770096) (← links)
- Acceleration of sequential subspace optimization in Banach spaces by orthogonal search directions (Q1789677) (← links)
- On the unification of possibilistic fuzzy clustering: axiomatic development and convergence analysis (Q1795022) (← links)
- Summed squared distance error reduction by simultaneous multiprojections and applications (Q1855154) (← links)
- An inverse treatment planning model for intensity modulated radiation therapy with dynamic MLC (Q1855982) (← links)
- The adventures of a simple algorithm (Q1863543) (← links)
- Duality for Bregman projections onto translated cones and affine subspaces. (Q1874472) (← links)
- Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory (Q1879959) (← links)
- Estimation of asset demands by heterogeneous agents (Q1887928) (← links)
- A projection method for semidefinite linear systems and its applications (Q1888336) (← links)
- Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
- Convergence and perturbation resilience of dynamic string-averaging projection methods (Q1938920) (← links)
- Relaxation methods for solving linear inequality systems: converging results (Q1939079) (← links)
- Alternating minimization as sequential unconstrained minimization: a survey (Q1949577) (← links)
- A system of generalized mixed equilibrium problems and fixed point problems for pseudocontractive mappings in Hilbert spaces (Q1958030) (← links)
- On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms (Q1959594) (← links)
- Hyperlink regression via Bregman divergence (Q1980417) (← links)
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy (Q2020314) (← links)