K. Kiwiel

发表

Proximal Minimization Methods with Generalized Bregman Functions

K. Kiwiel, 1997 .

Convergence of the steepest descent method for minimizing quasiconvex functions

K. G. Murty, K. Kiwiel, 1996 .

Parallel Subgradient Methods for Convex Optimization

K. Kiwiel, P. Lindberg, 2001 .

Methods of Descent for Nondifferentiable Optimization

K. Kiwiel, 1985 .

Generalized Bregman Projections in Convex Feasibility Problems

K. Kiwiel, 1998 .

A method for minimizing the sum of a convex function and a continuously differentiable function

K. Kiwiel, 1986 .

Proximity control in bundle methods for convex nondifferentiable minimization

Krzysztof C. Kiwiel, K. Kiwiel, Krzysztof C. Kiwiel, 1990, Math. Program..

A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems

K. Kiwiel, 1989 .

A constraint linearization method for nondifferentiable convex minimization

K. Kiwiel, 1987 .

An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems

K. Kiwiel, 1985 .

An algorithm for linearly constrained convex nondifferentiable minimization problems

K. Kiwiel, 1985 .

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

K. Kiwiel, 2007 .

Power management in a hydro-thermal system under uncertainty by Lagrangian relaxation

K. Kiwiel, W. Römisch, N. Gröwe-Kuska, 2002 .

A linearization method for minimizing certain quasidifferentiable functions

K. Kiwiel, 1986 .

A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization

Krzysztof C. Kiwiel, K. Kiwiel, 2010, SIAM J. Optim..

Relaxation Methods for Strictly Convex Regularizations of Piecewise Linear Programs

K. Kiwiel, 1998 .

An aggregate subgradient method for nonsmooth convex minimization

Krzysztof C. Kiwiel, K. Kiwiel, 1983, Math. Program..

A Variable Metric Method of Centres for Nonsmooth Minimization

K. Kiwiel, 1981 .

Convergence and efficiency of subgradient methods for quasiconvex minimization

Krzysztof C. Kiwiel, K. Kiwiel, 2001, Math. Program..

On the twice differentiable cubic augmented Lagrangian

K. Kiwiel, 1996 .

A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization

K. Kiwiel, 1986 .

Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization

Krzysztof C. Kiwiel, K. Kiwiel, 2003, SIAM J. Optim..

The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization

Torbjörn Larsson, Per Olov Lindberg, Krzysztof C. Kiwiel, 1999, Math. Oper. Res..

Finding normal solutions in piecewise linear programming

K. Kiwiel, 1995 .

The Efficiency of Subgradient Projection Methods for Convex Optimization

K. Kiwiel, 1996 .

A Cholesky dual method for proximal piecewise linear programming

K. Kiwiel, 1994 .

Monotone gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems

K. Kiwiel, 1997 .

Block-iterative surrogate projection methods for convex feasibility problems

K. Kiwiel, 1995 .

The efficiency of subgradient projection methods for convex optimization, part I: general level methods

K. Kiwiel, 1996 .

An ellipsoid trust region bundle method for nonsmooth convex minimization

K. Kiwiel, 1989 .

Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem

K. Kiwiel, 2008 .

An inexact bundle variant suited to column generation

Claude Lemaréchal, Krzysztof C. Kiwiel, C. Lemaréchal, 2009, Math. Program..

An algorithm for nonsmooth convex minimization with errors

K. Kiwiel, 1985 .

Approximations in proximal bundle methods and decomposition of convex programs

K. Kiwiel, 1995 .

Solving Unit Commitment Problems in Power Production Planning

K. Kiwiel, P. Lindberg, S. Feltenmark, 1997 .

Iterative schemes for the least 2-norm solution of piecewise linear programs

K. Kiwiel, 1995 .

Efficiency of Proximal Bundle Methods

K. Kiwiel, 2000 .

Decomposition via Alternating Linearization

K. Kiwiel, A. Ruszczynski, C. H. Rosa, 1995 .

A descent method for nonsmooth convex multiobjective minimization

K. Kiwiel, 1985 .

An inexact conic bundle variant suited to column generation

C. Lemaréchal, K. Kiwiel, 2006 .

A Spectral Bundle Method with Bounds Revised September 26 , 2001 To appear in Mathematical Programming

K. Kiwiel, C. Helmberg, 2011 .

Inexact Dynamic Bundle Methods

K. Kiwiel, 2010 .

A Projection-Proximal Bundle Method for Convex Nondifferentiable Minimization

Krzysztof C. Kiwiel, K. Kiwiel, 1999 .

TECHNICAL NOTE Convergence of the Steepest Descent Method for Minimizing Quasiconvex Functions 1'2

K. Kiwiel, K. Murty, 1996 .

A Note on the Twice Differentiable Cubic Augmented Lagrangian

K. Kiwiel, 1994 .

Long-Step Surrogate Subgradient Methods for Convex Feasibility Problems

K. Kiwiel, B. Lopuch, 1997 .

A Bregman-Projected Subgradient Method for Convex Constrained Nondifferentiable Minimization

K. Kiwiel, 1997 .

An algorithm for large-scale linearly constrained nondifferentiable convex minimization

K. Kiwiel, 1990 .

Lagrangian Relaxation via Ballstep Subgradient Methods

Torbjörn Larsson, Per Olov Lindberg, Krzysztof C. Kiwiel, 2007, Math. Oper. Res..

Convergence of a simple subgradient level method

Jean-Louis Goffin, Krzysztof C. Kiwiel, K. Kiwiel, 1999, Math. Program..

Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization

Krzysztof C. Kiwiel, K. Kiwiel, 1997, SIAM J. Optim..

Improved randomized selection

Krzysztof C. Kiwiel, K. Kiwiel, 2004, ArXiv.

Randomized selection with tripartitioning

Krzysztof C. Kiwiel, K. Kiwiel, 2004, ArXiv.

Randomized selection with quintary partitions

Krzysztof C. Kiwiel, K. Kiwiel, 2003, ArXiv.

Partitioning schemes for quicksort and quickselect

Krzysztof C. Kiwiel, K. Kiwiel, 2003, ArXiv.

Randomized selection revisited

Krzysztof C. Kiwiel, K. Kiwiel, 2002, ArXiv.

A direct method of linearization for continuous minimax problems

K. C. Kiwiel, K. Kiwiel, 1987 .

A quadratic approximation method for minimizing a class of quasidifferentiable functions

Krzysztof C. Kiwiel, K. Kiwiel, 1984 .

Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization

Krzysztof C. Kiwiel, K. Kiwiel, 1996, SIAM J. Optim..

Proximal Decomposition Via Alternating Linearization

Andrzej Ruszczynski, Charles H. Rosa, Krzysztof C. Kiwiel, 1999, SIAM J. Optim..

Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems

Stefan Feltenmark, Krzysztof C. Kiwiel, K. Kiwiel, 1999, SIAM J. Optim..

Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization

Krzysztof C. Kiwiel, K. Kiwiel, 2007, SIAM J. Optim..

A Linearization Algorithm for Nonsmooth Minimization

Krzysztof C. Kiwiel, K. Kiwiel, 1985, Math. Oper. Res..

Power Management under Uncertainty by Lagrangian Relaxation

K. C. Kiwiel, W. Römisch, K. Kiwiel, 2007 .

Mean value cross decomposition for nonlinear convex problems

Kaj Holmberg, Krzysztof C. Kiwiel, K. Kiwiel, 2006, Optim. Methods Softw..

Breakpoint searching algorithms for the continuous quadratic knapsack problem

Krzysztof C. Kiwiel, K. Kiwiel, 2007, Math. Program..

On Floyd and Rivest's SELECT algorithm

Krzysztof C. Kiwiel, K. Kiwiel, 2005, Theor. Comput. Sci..

Subgradient Method with Entropic Projections for Convex Nondifferentiable Minimization

K. C. Kiwiel, K. Kiwiel, 1998 .

A spectral bundle method with bounds

Christoph Helmberg, Krzysztof C. Kiwiel, K. Kiwiel, 2002, Math. Program..

Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization

Krzysztof C. Kiwiel, K. Kiwiel, 1991, Math. Program..

A tilted cutting plane proximal bundle method for convex nondifferentiable optimization

Krzysztof C. Kiwiel, K. Kiwiel, 1991, Oper. Res. Lett..

Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints

Krzysztof C. Kiwiel, K. Kiwiel, 1997, Math. Oper. Res..

Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities

Krzysztof C. Kiwiel, K. Kiwiel, 1995, Math. Program..

An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems

Krzysztof C. Kiwiel, K. Kiwiel, 2011, Math. Program..

Issues of Effectiveness Arising in the Design of a System of Nondifferentiable Optimization Algorithms

Krzysztof C. Kiwiel, Andrzej Stachurski, K. Kiwiel, 1989 .

Complexity of some cutting plane methods that use analytic centers

Krzysztof C. Kiwiel, K. Kiwiel, 1996, Math. Program..

A note on some analytic center cutting plane methods for convex feasibility and minimization problems

Krzysztof C. Kiwiel, Anna Altman, K. Kiwiel, 1996, Comput. Optim. Appl..

A Proximal Bundle Method with Approximate Subgradient Linearizations

Krzysztof C. Kiwiel, K. Kiwiel, 2006, SIAM J. Optim..

Bundle Methods for Convex Minimization with Partially Inexact

K. C. Kiwiel, K. Kiwiel, Oracles, 2010 .

Bregman Proximal Relaxation of Large-Scale 0–1 Problems

Per Olov Lindberg, Krzysztof C. Kiwiel, Andreas Nõu, 2000, Comput. Optim. Appl..

Incorporating Inequality Constraints in the Spectral Bundle Method

Franz Rendl, Christoph Helmberg, Krzysztof C. Kiwiel, 1998, IPCO.

Descent methods for quasidifferentiable minimization

Krzysztof C. Kiwiel, K. Kiwiel, 1988 .

Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings

Krzysztof C. Kiwiel, Bozena Lopuch, K. Kiwiel, 1997, SIAM J. Optim..