default search action
Krzysztof C. Kiwiel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
- [j35]Krzysztof C. Kiwiel:
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems. Math. Program. 130(1): 59-84 (2011) - 2010
- [j34]Krzysztof C. Kiwiel:
An Inexact Bundle Approach to Cutting-Stock Problems. INFORMS J. Comput. 22(1): 131-143 (2010) - [j33]Krzysztof C. Kiwiel:
A Nonderivative Version of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization. SIAM J. Optim. 20(4): 1983-1994 (2010)
2000 – 2009
- 2009
- [j32]Krzysztof C. Kiwiel, Claude Lemaréchal:
An inexact bundle variant suited to column generation. Math. Program. 118(1): 177-206 (2009) - 2008
- [j31]Krzysztof C. Kiwiel:
Breakpoint searching algorithms for the continuous quadratic knapsack problem. Math. Program. 112(2): 473-491 (2008) - [j30]Krzysztof C. Kiwiel:
A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization. SIAM J. Optim. 18(4): 1467-1489 (2008) - 2007
- [j29]Krzysztof C. Kiwiel, Torbjörn Larsson
, Per Olov Lindberg:
Lagrangian Relaxation via Ballstep Subgradient Methods. Math. Oper. Res. 32(3): 669-686 (2007) - [j28]Krzysztof C. Kiwiel:
Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization. SIAM J. Optim. 18(2): 379-388 (2007) - 2006
- [j27]Kaj Holmberg, Krzysztof C. Kiwiel:
Mean value cross decomposition for nonlinear convex problems. Optim. Methods Softw. 21(3): 401-417 (2006) - [j26]Krzysztof C. Kiwiel:
A Proximal Bundle Method with Approximate Subgradient Linearizations. SIAM J. Optim. 16(4): 1007-1023 (2006) - [j25]Krzysztof C. Kiwiel:
A Proximal-Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming. SIAM J. Optim. 17(4): 1015-1034 (2006) - 2005
- [j24]Krzysztof C. Kiwiel:
On Floyd and Rivest's SELECT algorithm. Theor. Comput. Sci. 347(1-2): 214-238 (2005) - 2004
- [j23]Krzysztof C. Kiwiel:
Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization. SIAM J. Optim. 14(3): 807-840 (2004) - [i5]Krzysztof C. Kiwiel:
Randomized selection with tripartitioning. CoRR cs.DS/0401003 (2004) - [i4]Krzysztof C. Kiwiel:
Improved randomized selection. CoRR cs.DS/0402005 (2004) - 2003
- [i3]Krzysztof C. Kiwiel:
Partitioning schemes for quicksort and quickselect. CoRR cs.DS/0312054 (2003) - [i2]Krzysztof C. Kiwiel:
Randomized selection with quintary partitions. CoRR cs.DS/0312055 (2003) - 2002
- [j22]Christoph Helmberg, Krzysztof C. Kiwiel:
A spectral bundle method with bounds. Math. Program. 93(2): 173-194 (2002) - [i1]Krzysztof C. Kiwiel:
Randomized selection revisited. CoRR cs.DS/0204033 (2002) - 2001
- [j21]Krzysztof C. Kiwiel:
Convergence and efficiency of subgradient methods for quasiconvex minimization. Math. Program. 90(1): 1-25 (2001) - 2000
- [j20]Krzysztof C. Kiwiel, Per Olov Lindberg, Andreas Nõu:
Bregman Proximal Relaxation of Large-Scale 0-1 Problems. Comput. Optim. Appl. 15(1): 33-44 (2000) - [j19]Stefan Feltenmark, Krzysztof C. Kiwiel:
Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems. SIAM J. Optim. 10(3): 697-721 (2000)
1990 – 1999
- 1999
- [j18]Krzysztof C. Kiwiel, Torbjörn Larsson
The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization. Math. Oper. Res. 24(1): 237-254 (1999) - [j17]Jean-Louis Goffin, Krzysztof C. Kiwiel:
Convergence of a simple subgradient level method. Math. Program. 85(1): 207-211 (1999) - [j16]Krzysztof C. Kiwiel:
A bundle Bregman proximal method for convex nondifferentiable minimization. Math. Program. 85(2): 241-258 (1999) - [j15]Krzysztof C. Kiwiel, Charles H. Rosa, Andrzej Ruszczynski:
Proximal Decomposition Via Alternating Linearization. SIAM J. Optim. 9(3): 668-689 (1999) - 1998
- [c1]Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl:
Incorporating Inequality Constraints in the Spectral Bundle Method. IPCO 1998: 423-436 - 1997
- [j14]Krzysztof C. Kiwiel:
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints. Math. Oper. Res. 22(2): 326-349 (1997) - [j13]Krzysztof C. Kiwiel:
Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization. SIAM J. Optim. 7(2): 336-346 (1997) - [j12]Krzysztof C. Kiwiel, Bozena Lopuch:
Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings. SIAM J. Optim. 7(4): 1084-1102 (1997) - 1996
- [j11]Anna Altman, Krzysztof C. Kiwiel:
A note on some analytic center cutting plane methods for convex feasibility and minimization problems. Comput. Optim. Appl. 5(2): 175-180 (1996) - [j10]Krzysztof C. Kiwiel:
Complexity of some cutting plane methods that use analytic centers. Math. Program. 74: 47-54 (1996) - [j9]Krzysztof C. Kiwiel:
Restricted Step and Levenberg-Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization. SIAM J. Optim. 6(1): 227-249 (1996) - 1995
- [j8]Krzysztof C. Kiwiel:
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math. Program. 69: 89-109 (1995) - [j7]Ulf Brännlund, Krzysztof C. Kiwiel, Per Olov Lindberg:
A descent proximal level bundle method for convex nondifferentiable optimization. Oper. Res. Lett. 17(3): 121-126 (1995) - 1991
- [j6]Krzysztof C. Kiwiel:
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math. Program. 52: 285-302 (1991) - [j5]Krzysztof C. Kiwiel:
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization. Oper. Res. Lett. 10(2): 75-81 (1991) - 1990
- [j4]Krzysztof C. Kiwiel:
Proximity Control in Bundle Methods for Convex Nondifferentiable Minimization. Math. Program. 46: 105-122 (1990)
1980 – 1989
- 1986
- [j3]Krzysztof C. Kiwiel:
A method of linearizations for linearly constrained nonconvex nonsmooth minimization. Math. Program. 34(2): 175-187 (1986) - 1985
- [j2]Krzysztof Czeslaw Kiwiel:
A Linearization Algorithm for Nonsmooth Minimization. Math. Oper. Res. 10(2): 185-194 (1985) - 1983
- [j1]Krzysztof C. Kiwiel:
An aggregate subgradient method for nonsmooth convex minimization. Math. Program. 27(3): 320-341 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: