The following pages link to Krzysztof C. Kiwiel (Q173838):
Displaying 44 items.
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization (Q3544270) (← links)
- (Q3677518) (← links)
- (Q3678980) (← links)
- A Linearization Algorithm for Nonsmooth Minimization (Q3680622) (← links)
- (Q3691428) (← links)
- An Algorithm for Nonsmooth Convex Minimization With Errors (Q3707271) (← links)
- (Q3707780) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
- A linearization method for minimizing certain quasidifferentiable functions (Q3730360) (← links)
- (Q3738946) (← links)
- A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization (Q3740142) (← links)
- A linearization algorithm for optimizing control systems subject to singular value inequalities (Q3759454) (← links)
- (Q3768672) (← links)
- Randomized search directions in descent methods for minimizing certain quasidifferentiable functions (Q3783076) (← links)
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems (Q3813167) (← links)
- (Q3840376) (← links)
- (Q4000249) (← links)
- (Q4007057) (← links)
- (Q4028937) (← links)
- (Q4233329) (← links)
- (Q4233330) (← links)
- (Q4233371) (← links)
- Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization (Q4340806) (← links)
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints (Q4346226) (← links)
- (Q4356861) (← links)
- (Q4356870) (← links)
- (Q4356871) (← links)
- Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings (Q4376148) (← links)
- Proximal Minimization Methods with Generalized Bregman Functions (Q4377388) (← links)
- (Q4428687) (← links)
- Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems (Q4509733) (← links)
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization (Q4651971) (← links)
- Proximal Decomposition Via Alternating Linearization (Q4702304) (← links)
- (Q4733677) (← links)
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods (Q4876723) (← links)
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions (Q4876724) (← links)
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization (Q4877514) (← links)
- (Q4945773) (← links)
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems (Q5186649) (← links)
- Lagrangian Relaxation via Ballstep Subgradient Methods (Q5388054) (← links)
- A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming (Q5426895) (← links)
- A Proximal Bundle Method with Approximate Subgradient Linearizations (Q5470229) (← links)
- Mean value cross decomposition for nonlinear convex problems (Q5475282) (← links)
- Convergence and efficiency of subgradient methods for quasiconvex minimization (Q5930722) (← links)
