AAAAAA

   
Results: 1-21 |
Results: 21
RELAXATION METHODS FOR STRICTLY CONVEX REGULARIZATIONS OF PIECEWISE-LINEAR PROGRAMS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, RELAXATION METHODS FOR STRICTLY CONVEX REGULARIZATIONS OF PIECEWISE-LINEAR PROGRAMS, Applied mathematics & optimization, 38(3), 1998, pp. 239-259
GENERALIZED BREGMAN PROJECTIONS IN CONVEX FEASIBILITY PROBLEMS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, GENERALIZED BREGMAN PROJECTIONS IN CONVEX FEASIBILITY PROBLEMS, Journal of optimization theory and applications, 96(1), 1998, pp. 139-157
SUBGRADIENT METHOD WITH ENTROPIC PROJECTIONS FOR CONVEX NONDIFFERENTIABLE MINIMIZATION
Authors: KIWIEL KC
Citation: Kc. Kiwiel, SUBGRADIENT METHOD WITH ENTROPIC PROJECTIONS FOR CONVEX NONDIFFERENTIABLE MINIMIZATION, Journal of optimization theory and applications, 96(1), 1998, pp. 159-173
SURROGATE PROJECTION METHODS FOR FINDING FIXED-POINTS OF FIRMLY NONEXPANSIVE-MAPPINGS
Authors: KIWIEL KC LOPUCH B
Citation: Kc. Kiwiel et B. Lopuch, SURROGATE PROJECTION METHODS FOR FINDING FIXED-POINTS OF FIRMLY NONEXPANSIVE-MAPPINGS, SIAM journal on optimization, 7(4), 1997, pp. 1084-1102
EFFICIENCY OF THE ANALYTIC CENTER CUTTING PLANE METHOD FOR CONVEX MINIMIZATION
Authors: KIWIEL KC
Citation: Kc. Kiwiel, EFFICIENCY OF THE ANALYTIC CENTER CUTTING PLANE METHOD FOR CONVEX MINIMIZATION, SIAM journal on optimization, 7(2), 1997, pp. 336-346
FREE-STEERING RELAXATION METHODS FOR PROBLEMS WITH STRICTLY CONVEX COSTS AND LINEAR CONSTRAINTS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, FREE-STEERING RELAXATION METHODS FOR PROBLEMS WITH STRICTLY CONVEX COSTS AND LINEAR CONSTRAINTS, Mathematics of operations research, 22(2), 1997, pp. 326-349
PROXIMAL MINIMIZATION METHODS WITH GENERALIZED BREGMAN FUNCTIONS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, PROXIMAL MINIMIZATION METHODS WITH GENERALIZED BREGMAN FUNCTIONS, SIAM journal on control and optimization, 35(4), 1997, pp. 1142-1168
MONOTONE GRAM MATRICES AND DEEPEST SURROGATE INEQUALITIES IN ACCELERATED RELAXATION METHODS FOR CONVEX FEASIBILITY PROBLEMS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, MONOTONE GRAM MATRICES AND DEEPEST SURROGATE INEQUALITIES IN ACCELERATED RELAXATION METHODS FOR CONVEX FEASIBILITY PROBLEMS, Linear algebra and its applications, 252, 1997, pp. 27-33
RESTRICTED STEP AND LEVENBERG-MARQUARDT TECHNIQUES IN PROXIMAL BUNDLEMETHODS FOR NONCONVEX NONDIFFERENTIABLE OPTIMIZATION
Authors: KIWIEL KC
Citation: Kc. Kiwiel, RESTRICTED STEP AND LEVENBERG-MARQUARDT TECHNIQUES IN PROXIMAL BUNDLEMETHODS FOR NONCONVEX NONDIFFERENTIABLE OPTIMIZATION, SIAM journal on optimization, 6(1), 1996, pp. 227-249
THE EFFICIENCY OF SUBGRADIENT PROJECTION METHODS FOR CONVEX-OPTIMIZATION .1. GENERAL LEVEL METHODS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, THE EFFICIENCY OF SUBGRADIENT PROJECTION METHODS FOR CONVEX-OPTIMIZATION .1. GENERAL LEVEL METHODS, SIAM journal on control and optimization, 34(2), 1996, pp. 660-676
THE EFFICIENCY OF SUBGRADIENT PROJECTION METHODS FOR CONVEX-OPTIMIZATION .2. IMPLEMENTATIONS AND EXTENSIONS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, THE EFFICIENCY OF SUBGRADIENT PROJECTION METHODS FOR CONVEX-OPTIMIZATION .2. IMPLEMENTATIONS AND EXTENSIONS, SIAM journal on control and optimization, 34(2), 1996, pp. 677-697
COMPLEXITY OF SOME CUTTING PLANE METHODS THAT USE ANALYTIC CENTERS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, COMPLEXITY OF SOME CUTTING PLANE METHODS THAT USE ANALYTIC CENTERS, Mathematical programming, 74(1), 1996, pp. 47-54
CONVERGENCE OF THE STEEPEST DESCENT METHOD FOR MINIMIZING QUASI-CONVEX FUNCTIONS
Authors: KIWIEL KC MURTY K
Citation: Kc. Kiwiel et K. Murty, CONVERGENCE OF THE STEEPEST DESCENT METHOD FOR MINIMIZING QUASI-CONVEX FUNCTIONS, Journal of optimization theory and applications, 89(1), 1996, pp. 221-226
ON THE TWICE DIFFERENTIABLE CUBIC AUGMENTED LAGRANGIAN
Authors: KIWIEL KC
Citation: Kc. Kiwiel, ON THE TWICE DIFFERENTIABLE CUBIC AUGMENTED LAGRANGIAN, Journal of optimization theory and applications, 88(1), 1996, pp. 233-236
A DESCENT PROXIMAL LEVEL BUNDLE METHOD FOR CONVEX NONDIFFERENTIABLE OPTIMIZATION
Authors: BRANNLUND U KIWIEL KC LINDBERG PO
Citation: U. Brannlund et al., A DESCENT PROXIMAL LEVEL BUNDLE METHOD FOR CONVEX NONDIFFERENTIABLE OPTIMIZATION, Operations research letters, 17(3), 1995, pp. 121-126
FINDING NORMAL SOLUTIONS IN PIECEWISE-LINEAR PROGRAMMING
Authors: KIWIEL KC
Citation: Kc. Kiwiel, FINDING NORMAL SOLUTIONS IN PIECEWISE-LINEAR PROGRAMMING, Applied mathematics & optimization, 32(3), 1995, pp. 235-254
PROXIMAL LEVEL BUNDLE METHODS FOR CONVEX NONDIFFERENTIABLE OPTIMIZATION, SADDLE-POINT PROBLEMS AND VARIATIONAL-INEQUALITIES
Authors: KIWIEL KC
Citation: Kc. Kiwiel, PROXIMAL LEVEL BUNDLE METHODS FOR CONVEX NONDIFFERENTIABLE OPTIMIZATION, SADDLE-POINT PROBLEMS AND VARIATIONAL-INEQUALITIES, Mathematical programming, 69(1), 1995, pp. 89-109
ITERATIVE SCHEMES FOR THE LEAST 2-NORM SOLUTION OF PIECEWISE-LINEAR PROGRAMS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, ITERATIVE SCHEMES FOR THE LEAST 2-NORM SOLUTION OF PIECEWISE-LINEAR PROGRAMS, Linear algebra and its applications, 229, 1995, pp. 1-7
BLOCK-ITERATIVE SURROGATE PROJECTION METHODS FOR CONVEX FEASIBILITY PROBLEMS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, BLOCK-ITERATIVE SURROGATE PROJECTION METHODS FOR CONVEX FEASIBILITY PROBLEMS, Linear algebra and its applications, 215, 1995, pp. 225-259
APPROXIMATIONS IN PROXIMAL BUNDLE METHODS AND DECOMPOSITION OF CONVEX-PROGRAMS
Authors: KIWIEL KC
Citation: Kc. Kiwiel, APPROXIMATIONS IN PROXIMAL BUNDLE METHODS AND DECOMPOSITION OF CONVEX-PROGRAMS, Journal of optimization theory and applications, 84(3), 1995, pp. 529-548
A CHOLESKY DUAL METHOD FOR PROXIMAL PIECEWISE-LINEAR PROGRAMMING
Authors: KIWIEL KC
Citation: Kc. Kiwiel, A CHOLESKY DUAL METHOD FOR PROXIMAL PIECEWISE-LINEAR PROGRAMMING, Numerische Mathematik, 68(3), 1994, pp. 325-340
Risultati: 1-21 |