The following pages link to Krzysztof C. Kiwiel (Q173838):
Displaying 50 items.
- (Q647396) (redirect page) (← links)
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems (Q647397) (← links)
- Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems (Q676010) (← links)
- Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization (Q848722) (← links)
- Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
- Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- A method for minimizing the sum of a convex function and a continuously differentiable function (Q1057185) (← links)
- An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
- A quadratic approximation method for minimizing a class of quasidifferentiable functions (Q1063391) (← links)
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions (Q1071652) (← links)
- An aggregate subgradient method for nonsmooth and nonconvex minimization (Q1082780) (← links)
- A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
- A constraint linearization method for nondifferentiable convex minimization (Q1099787) (← links)
- Descent methods for quasidifferentiable minimization (Q1109687) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- Relaxation methods for strictly convex regularizations of piecewise linear programs (Q1273445) (← links)
- Convergence of a simple subgradient level method (Q1295965) (← links)
- A bundle Bregman proximal method for convex nondifferentiable minimization (Q1300267) (← links)
- A Cholesky dual method for proximal piecewise linear programming (Q1338808) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Complexity of some cutting plane methods that use analytic centers (Q1352301) (← links)
- Generalized Bregman projections in convex feasibility problems (Q1384057) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- A spectral bundle method with bounds (Q1396209) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- A note on some analytic center cutting plane methods for convex feasibility and minimization problems (Q1815078) (← links)
- A direct method of linearization for continuous minimax problems (Q1821697) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- Finding normal solutions in piecewise linear programming (Q1900115) (← links)
- Iterative schemes for the least 2-norm solution of piecewise linear programs (Q1902107) (← links)
- A descent proximal level bundle method for convex nondifferentiable optimization (Q1905073) (← links)
- On the twice differentiable cubic augmented Lagrangian (Q1908654) (← links)
- Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities (Q1922692) (← links)
- Bregman proximal relaxation of large-scale 0-1 problems (Q1967121) (← links)
- Methods of descent for nondifferentiable optimization (Q2266668) (← links)
- Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
- On linear-time algorithms for the continuous quadratic Knapsack problem (Q2471117) (← links)
- On Floyd and Rivest's SELECT algorithm (Q2576874) (← links)
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization (Q2638937) (← links)
- A restricted step proximal bundle method for nonconvex nondifferentiable optimization (Q2710353) (← links)
- The efficiency of ballstep subgradient level methods for convex optimization (Q2757593) (← links)
- Parallel subgradient methods for convex optimization. (Q2768025) (← links)
- An inexact bundle approach to cutting-stock problems (Q2899044) (← links)
- An aggregate subgradient method for nonsmooth convex minimization (Q3039046) (← links)
- A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization (Q3058518) (← links)
- (Q3220101) (← links)
- An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization (Q3470060) (← links)
- (Q3489793) (← links)
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization (Q3503200) (← links)
