Krzysztof C. Kiwiel

According to our database1, Krzysztof C. Kiwiel authored at least 41 papers between 1983 and 2011.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2011
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems.
Math. Program., 2011

2010
A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization.
SIAM J. Optim., 2010

An Inexact Bundle Approach to Cutting-Stock Problems.
INFORMS J. Comput., 2010

2009
An inexact bundle variant suited to column generation.
Math. Program., 2009

2008
A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization.
SIAM J. Optim., 2008

Breakpoint searching algorithms for the continuous quadratic knapsack problem.
Math. Program., 2008

2007
Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization.
SIAM J. Optim., 2007

Lagrangian Relaxation via Ballstep Subgradient Methods.
Math. Oper. Res., 2007

2006
A Proximal Bundle Method with Approximate Subgradient Linearizations.
SIAM J. Optim., 2006

A Proximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming.
SIAM J. Optim., 2006

Mean value cross decomposition for nonlinear convex problems.
Optim. Methods Softw., 2006

2005
On Floyd and Rivest's SELECT algorithm.
Theor. Comput. Sci., 2005

2004
Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization.
SIAM J. Optim., 2004

Improved randomized selection
CoRR, 2004

Randomized selection with tripartitioning
CoRR, 2004

2003
Randomized selection with quintary partitions
CoRR, 2003

Partitioning schemes for quicksort and quickselect
CoRR, 2003

2002
A spectral bundle method with bounds.
Math. Program., 2002

Randomized selection revisited
CoRR, 2002

2001
Convergence and efficiency of subgradient methods for quasiconvex minimization.
Math. Program., 2001

2000
Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems.
SIAM J. Optim., 2000

Bregman Proximal Relaxation of Large-Scale 0-1 Problems.
Comput. Optim. Appl., 2000

1999
Proximal Decomposition Via Alternating Linearization.
SIAM J. Optim., 1999

A bundle Bregman proximal method for convex nondifferentiable minimization.
Math. Program., 1999

Convergence of a simple subgradient level method.
Math. Program., 1999

The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization.
Math. Oper. Res., 1999

1998
Incorporating Inequality Constraints in the Spectral Bundle Method.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

1997
Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings.
SIAM J. Optim., 1997

Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization.
SIAM J. Optim., 1997

Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints.
Math. Oper. Res., 1997

1996
Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization.
SIAM J. Optim., 1996

Complexity of some cutting plane methods that use analytic centers.
Math. Program., 1996

A note on some analytic center cutting plane methods for convex feasibility and minimization problems.
Comput. Optim. Appl., 1996

1995
A descent proximal level bundle method for convex nondifferentiable optimization.
Oper. Res. Lett., 1995

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

1991
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization.
Oper. Res. Lett., 1991

Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization.
Math. Program., 1991

1990
Proximity Control in Bundle Methods for Convex Nondifferentiable Minimization.
Math. Program., 1990

1986
A method of linearizations for linearly constrained nonconvex nonsmooth minimization.
Math. Program., 1986

1985
A Linearization Algorithm for Nonsmooth Minimization.
Math. Oper. Res., 1985

1983
An aggregate subgradient method for nonsmooth convex minimization.
Math. Program., 1983


  Loading...