The following pages link to K. A. Ariyawansa (Q161389):
Displaying 32 items.
- (Q173855) (redirect page) (← links)
- A preliminary set of applications leading to stochastic semidefinite programs and chance-constrained semidefinite programs (Q554728) (← links)
- Stochastic semidefinite programming: a new paradigm for stochastic optimization (Q862822) (← links)
- A class of volumetric barrier decomposition algorithms for stochastic quadratic programming (Q884639) (← links)
- A network model of geometrically constrained deformations of granular materials (Q939237) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: Derivation and computational results (Q1026441) (← links)
- On accelerating Newton's method based on a conic model (Q1118983) (← links)
- Line search termination criteria for collinear scaling algorithms for minimizing a class of convex functions (Q1272810) (← links)
- Local convergence of collinear scaling algorithms related to direct least-change secant update methods for minimization (Q1281792) (← links)
- On the updating scheme in a class of collinear scaling algorithms for sparse minimization (Q1321251) (← links)
- On Davidon's collinear scaling algorithms for optimization (Q1332350) (← links)
- On the existence and uniqueness of maximizers of two likelihood functions (Q1342795) (← links)
- A note on line search termination criteria for collinear scaling algorithms (Q1404542) (← links)
- Global convergence of a class of collinear scaling algorithms with inexact line searches on convex functions (Q1818416) (← links)
- Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming (Q2257767) (← links)
- Deriving collinear scaling algorithms as extensions of quasi-Newton methods and the local convergence of DFP- and BFGS-related collinear scaling algorithms (Q2277145) (← links)
- A class of collinear scaling algorithms for bound-constrained optimization: convergence theorems (Q2371881) (← links)
- A family of stochastic programming test problems based on a model for tactical manpower planning (Q2583506) (← links)
- On a new collection of stochastic linear programming test problems (Q2890428) (← links)
- A class of polynomial volumetric barrier decomposition algorithms for stochastic semidefinite programming (Q3015050) (← links)
- (Q3139326) (← links)
- A CHARACTERIZATION OF CONVEXITY-PRESERVING MAPS FROM A SUBSET OF A VECTOR SPACE INTO ANOTHER VECTOR SPACE (Q3151040) (← links)
- On statistical control of optimization (Q3315287) (← links)
- (Q3696287) (← links)
- (Q3742490) (← links)
- (Q4312264) (← links)
- Local and<i>Q</i>-superlinear convergence of a class of collinear scaling algorithms that extends quasi-newton methods with broyden's bounded-⊘ class of updates† ‡ (Q4327895) (← links)
- On selecting an extreme value distribution (Q4711417) (← links)
- (Q4835588) (← links)
- A numerical evaluation of some collinear scaling algorithms for unconstrained (Q4836767) (← links)
- On complexity of the translational-cut algorithm for convex minimax problems (Q5925720) (← links)
- On a characterization of convexity-preserving maps, Davidon's collinear scalings and Karmarkar's projective transformations (Q5930729) (← links)
