Krzysztof C. Kiwiel

From MaRDI portal
Person:173838

Available identifiers

zbMath Open kiwiel.krzysztof-czeslawMaRDI QIDQ173838

List of research outcomes





PublicationDate of PublicationType
An inexact bundle approach to cutting-stock problems2012-07-28Paper
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems2011-11-23Paper
A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization2010-12-03Paper
Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization2010-03-05Paper
An inexact bundle variant suited to column generation2009-05-04Paper
A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization2008-12-05Paper
Variable fixing algorithms for the continuous quadratic Knapsack problem2008-06-04Paper
Lagrangian Relaxation via Ballstep Subgradient Methods2008-05-27Paper
Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization2008-05-22Paper
On linear-time algorithms for the continuous quadratic Knapsack problem2008-02-18Paper
Breakpoint searching algorithms for the continuous quadratic knapsack problem2008-01-07Paper
A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming2007-11-16Paper
Mean value cross decomposition for nonlinear convex problems2006-06-16Paper
A Proximal Bundle Method with Approximate Subgradient Linearizations2006-05-30Paper
On Floyd and Rivest's SELECT algorithm2005-12-29Paper
Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization2005-02-23Paper
https://portal.mardi4nfdi.de/entity/Q44286872003-09-22Paper
Convergence and efficiency of subgradient methods for quasiconvex minimization2002-06-16Paper
Parallel subgradient methods for convex optimization.2002-04-09Paper
A spectral bundle method with bounds2002-01-01Paper
The efficiency of ballstep subgradient level methods for convex optimization2001-11-26Paper
A restricted step proximal bundle method for nonconvex nondifferentiable optimization2001-04-23Paper
Convergence of a simple subgradient level method2001-03-20Paper
A bundle Bregman proximal method for convex nondifferentiable minimization2001-03-04Paper
Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems2000-10-19Paper
https://portal.mardi4nfdi.de/entity/Q49457732000-09-24Paper
Bregman proximal relaxation of large-scale 0-1 problems2000-08-20Paper
Efficiency of proximal bundle methods2000-08-09Paper
Proximal Decomposition Via Alternating Linearization1999-11-24Paper
Relaxation methods for strictly convex regularizations of piecewise linear programs1999-08-17Paper
https://portal.mardi4nfdi.de/entity/Q42333711999-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42333291999-03-16Paper
https://portal.mardi4nfdi.de/entity/Q42333301999-03-16Paper
Subgradient method with entropic projections for convex nondifferentiable minimization1998-10-19Paper
https://portal.mardi4nfdi.de/entity/Q38403761998-08-10Paper
Generalized Bregman projections in convex feasibility problems1998-04-13Paper
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints1998-03-23Paper
Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings1998-02-10Paper
Proximal Minimization Methods with Generalized Bregman Functions1998-02-09Paper
https://portal.mardi4nfdi.de/entity/Q43568701997-11-20Paper
https://portal.mardi4nfdi.de/entity/Q43568711997-11-20Paper
https://portal.mardi4nfdi.de/entity/Q43568611997-10-05Paper
Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems1997-09-17Paper
Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization1997-06-12Paper
A note on some analytic center cutting plane methods for convex feasibility and minimization problems1997-04-10Paper
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities1997-03-11Paper
Complexity of some cutting plane methods that use analytic centers1997-02-13Paper
Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization1996-09-04Paper
Finding normal solutions in piecewise linear programming1996-05-30Paper
The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods1996-05-06Paper
The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions1996-05-06Paper
On the twice differentiable cubic augmented Lagrangian1996-03-04Paper
A descent proximal level bundle method for convex nondifferentiable optimization1996-01-16Paper
Approximations in proximal bundle methods and decomposition of convex programs1995-11-20Paper
Iterative schemes for the least 2-norm solution of piecewise linear programs1995-11-14Paper
A Cholesky dual method for proximal piecewise linear programming1995-10-15Paper
Block-iterative surrogate projection methods for convex feasibility problems1995-04-04Paper
https://portal.mardi4nfdi.de/entity/Q40289371993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40070571992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40002491992-09-18Paper
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization1992-06-27Paper
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization1991-01-01Paper
Proximity control in bundle methods for convex nondifferentiable minimization1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34897931990-01-01Paper
A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems1989-01-01Paper
An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47336771989-01-01Paper
Descent methods for quasidifferentiable minimization1988-01-01Paper
Decomposition method of descent for minimizing the sum of convex nonsmooth functions1987-01-01Paper
A direct method of linearization for continuous minimax problems1987-01-01Paper
A constraint linearization method for nondifferentiable convex minimization1987-01-01Paper
A subgradient selection method for minimizing convex functions subject to linear constraints1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37686721987-01-01Paper
A method for minimizing the sum of a convex function and a continuously differentiable function1986-01-01Paper
An aggregate subgradient method for nonsmooth and nonconvex minimization1986-01-01Paper
A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization1986-01-01Paper
A method of linearizations for linearly constrained nonconvex nonsmooth minimization1986-01-01Paper
A linearization algorithm for optimizing control systems subject to singular value inequalities1986-01-01Paper
A linearization method for minimizing certain quasidifferentiable functions1986-01-01Paper
Randomized search directions in descent methods for minimizing certain quasidifferentiable functions1986-01-01Paper
Methods of descent for nondifferentiable optimization1985-01-01Paper
An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems1985-01-01Paper
An Algorithm for Nonsmooth Convex Minimization With Errors1985-01-01Paper
An algorithm for linearly constrained convex nondifferentiable minimization problems1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37389461985-01-01Paper
A Linearization Algorithm for Nonsmooth Minimization1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36789801985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37077801985-01-01Paper
A quadratic approximation method for minimizing a class of quasidifferentiable functions1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36914281984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32201011984-01-01Paper
An aggregate subgradient method for nonsmooth convex minimization1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36775181983-01-01Paper

Research outcomes over time

This page was built for person: Krzysztof C. Kiwiel