| Publication | Date of Publication | Type |
|---|
An inexact bundle approach to cutting-stock problems
INFORMS Journal on Computing | 2012-07-28 | Paper |
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
Mathematical Programming. Series A. Series B | 2011-11-23 | Paper |
A nonderivative version of the gradient sampling algorithm for nonsmooth nonconvex optimization
SIAM Journal on Optimization | 2010-12-03 | Paper |
Improved convergence result for the discrete gradient and secant methods for nonsmooth optimization
Journal of Optimization Theory and Applications | 2010-03-05 | Paper |
An inexact bundle variant suited to column generation
Mathematical Programming. Series A. Series B | 2009-05-04 | Paper |
A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
SIAM Journal on Optimization | 2008-12-05 | Paper |
Variable fixing algorithms for the continuous quadratic Knapsack problem
Journal of Optimization Theory and Applications | 2008-06-04 | Paper |
Lagrangian Relaxation via Ballstep Subgradient Methods
Mathematics of Operations Research | 2008-05-27 | Paper |
Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
SIAM Journal on Optimization | 2008-05-22 | Paper |
On linear-time algorithms for the continuous quadratic Knapsack problem
Journal of Optimization Theory and Applications | 2008-02-18 | Paper |
Breakpoint searching algorithms for the continuous quadratic knapsack problem
Mathematical Programming. Series A. Series B | 2008-01-07 | Paper |
A Proximal‐Projection Bundle Method for Lagrangian Relaxation, Including Semidefinite Programming
SIAM Journal on Optimization | 2007-11-16 | Paper |
Mean value cross decomposition for nonlinear convex problems
Optimization Methods \& Software | 2006-06-16 | Paper |
A Proximal Bundle Method with Approximate Subgradient Linearizations
SIAM Journal on Optimization | 2006-05-30 | Paper |
On Floyd and Rivest's SELECT algorithm
Theoretical Computer Science | 2005-12-29 | Paper |
Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
SIAM Journal on Optimization | 2005-02-23 | Paper |
scientific article; zbMATH DE number 1984254 (Why is no real title available?)
| 2003-09-22 | Paper |
Convergence and efficiency of subgradient methods for quasiconvex minimization
Mathematical Programming. Series A. Series B | 2002-06-16 | Paper |
Parallel subgradient methods for convex optimization.
| 2002-04-09 | Paper |
A spectral bundle method with bounds
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
The efficiency of ballstep subgradient level methods for convex optimization
Mathematics of Operations Research | 2001-11-26 | Paper |
A restricted step proximal bundle method for nonconvex nondifferentiable optimization
| 2001-04-23 | Paper |
Convergence of a simple subgradient level method
Mathematical Programming. Series A. Series B | 2001-03-20 | Paper |
A bundle Bregman proximal method for convex nondifferentiable minimization
Mathematical Programming. Series A. Series B | 2001-03-04 | Paper |
Dual Applications of Proximal Bundle Methods, Including Lagrangian Relaxation of Nonconvex Problems
SIAM Journal on Optimization | 2000-10-19 | Paper |
scientific article; zbMATH DE number 1424526 (Why is no real title available?)
| 2000-09-24 | Paper |
Bregman proximal relaxation of large-scale 0-1 problems
Computational Optimization and Applications | 2000-08-20 | Paper |
Efficiency of proximal bundle methods
Journal of Optimization Theory and Applications | 2000-08-09 | Paper |
Proximal Decomposition Via Alternating Linearization
SIAM Journal on Optimization | 1999-11-24 | Paper |
Relaxation methods for strictly convex regularizations of piecewise linear programs
Applied Mathematics and Optimization | 1999-08-17 | Paper |
scientific article; zbMATH DE number 1264433 (Why is no real title available?)
| 1999-03-16 | Paper |
scientific article; zbMATH DE number 1264397 (Why is no real title available?)
| 1999-03-16 | Paper |
scientific article; zbMATH DE number 1264398 (Why is no real title available?)
| 1999-03-16 | Paper |
Subgradient method with entropic projections for convex nondifferentiable minimization
Journal of Optimization Theory and Applications | 1998-10-19 | Paper |
scientific article; zbMATH DE number 1187169 (Why is no real title available?)
| 1998-08-10 | Paper |
Generalized Bregman projections in convex feasibility problems
Journal of Optimization Theory and Applications | 1998-04-13 | Paper |
Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
Mathematics of Operations Research | 1998-03-23 | Paper |
Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings
SIAM Journal on Optimization | 1998-02-10 | Paper |
Proximal Minimization Methods with Generalized Bregman Functions
SIAM Journal on Control and Optimization | 1998-02-09 | Paper |
scientific article; zbMATH DE number 1070393 (Why is no real title available?)
| 1997-11-20 | Paper |
scientific article; zbMATH DE number 1070394 (Why is no real title available?)
| 1997-11-20 | Paper |
scientific article; zbMATH DE number 1070384 (Why is no real title available?)
| 1997-10-05 | Paper |
Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems
Linear Algebra and its Applications | 1997-09-17 | Paper |
Efficiency of the Analytic Center Cutting Plane Method for Convex Minimization
SIAM Journal on Optimization | 1997-06-12 | Paper |
A note on some analytic center cutting plane methods for convex feasibility and minimization problems
Computational Optimization and Applications | 1997-04-10 | Paper |
Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities
Mathematical Programming. Series A. Series B | 1997-03-11 | Paper |
Complexity of some cutting plane methods that use analytic centers
Mathematical Programming. Series A. Series B | 1997-02-13 | Paper |
Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
SIAM Journal on Optimization | 1996-09-04 | Paper |
Finding normal solutions in piecewise linear programming
Applied Mathematics and Optimization | 1996-05-30 | Paper |
The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
SIAM Journal on Control and Optimization | 1996-05-06 | Paper |
The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
SIAM Journal on Control and Optimization | 1996-05-06 | Paper |
On the twice differentiable cubic augmented Lagrangian
Journal of Optimization Theory and Applications | 1996-03-04 | Paper |
A descent proximal level bundle method for convex nondifferentiable optimization
Operations Research Letters | 1996-01-16 | Paper |
Approximations in proximal bundle methods and decomposition of convex programs
Journal of Optimization Theory and Applications | 1995-11-20 | Paper |
Iterative schemes for the least 2-norm solution of piecewise linear programs
Linear Algebra and its Applications | 1995-11-14 | Paper |
A Cholesky dual method for proximal piecewise linear programming
Numerische Mathematik | 1995-10-15 | Paper |
Block-iterative surrogate projection methods for convex feasibility problems
Linear Algebra and its Applications | 1995-04-04 | Paper |
scientific article; zbMATH DE number 140516 (Why is no real title available?)
| 1993-03-28 | Paper |
scientific article; zbMATH DE number 58789 (Why is no real title available?)
| 1992-09-27 | Paper |
scientific article; zbMATH DE number 50615 (Why is no real title available?)
| 1992-09-18 | Paper |
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
Operations Research Letters | 1991-01-01 | Paper |
Proximity control in bundle methods for convex nondifferentiable minimization
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
scientific article; zbMATH DE number 4162666 (Why is no real title available?)
| 1990-01-01 | Paper |
A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
SIAM Journal on Scientific and Statistical Computing | 1989-01-01 | Paper |
An Ellipsoid Trust Region Bundle Method for Nonsmooth Convex Minimization
SIAM Journal on Control and Optimization | 1989-01-01 | Paper |
scientific article; zbMATH DE number 4119953 (Why is no real title available?)
| 1989-01-01 | Paper |
Descent methods for quasidifferentiable minimization
Applied Mathematics and Optimization | 1988-01-01 | Paper |
Decomposition method of descent for minimizing the sum of convex nonsmooth functions
Journal of Optimization Theory and Applications | 1987-01-01 | Paper |
A direct method of linearization for continuous minimax problems
Journal of Optimization Theory and Applications | 1987-01-01 | Paper |
A constraint linearization method for nondifferentiable convex minimization
Numerische Mathematik | 1987-01-01 | Paper |
A subgradient selection method for minimizing convex functions subject to linear constraints
Computing | 1987-01-01 | Paper |
scientific article; zbMATH DE number 4027166 (Why is no real title available?)
| 1987-01-01 | Paper |
A method for minimizing the sum of a convex function and a continuously differentiable function
Journal of Optimization Theory and Applications | 1986-01-01 | Paper |
An aggregate subgradient method for nonsmooth and nonconvex minimization
Journal of Computational and Applied Mathematics | 1986-01-01 | Paper |
A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
IMA Journal of Numerical Analysis | 1986-01-01 | Paper |
A method of linearizations for linearly constrained nonconvex nonsmooth minimization
Mathematical Programming | 1986-01-01 | Paper |
A linearization algorithm for optimizing control systems subject to singular value inequalities
IEEE Transactions on Automatic Control | 1986-01-01 | Paper |
A linearization method for minimizing certain quasidifferentiable functions
Mathematical Programming Studies | 1986-01-01 | Paper |
Randomized search directions in descent methods for minimizing certain quasidifferentiable functions
Optimization | 1986-01-01 | Paper |
Methods of descent for nondifferentiable optimization
Lecture Notes in Mathematics | 1985-01-01 | Paper |
An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
IMA Journal of Numerical Analysis | 1985-01-01 | Paper |
An Algorithm for Nonsmooth Convex Minimization With Errors
| 1985-01-01 | Paper |
An algorithm for linearly constrained convex nondifferentiable minimization problems
Journal of Mathematical Analysis and Applications | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3972657 (Why is no real title available?)
| 1985-01-01 | Paper |
A Linearization Algorithm for Nonsmooth Minimization
Mathematics of Operations Research | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3900525 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3932811 (Why is no real title available?)
| 1985-01-01 | Paper |
A quadratic approximation method for minimizing a class of quasidifferentiable functions
Numerische Mathematik | 1984-01-01 | Paper |
scientific article; zbMATH DE number 3916028 (Why is no real title available?)
| 1984-01-01 | Paper |
scientific article; zbMATH DE number 3887449 (Why is no real title available?)
| 1984-01-01 | Paper |
An aggregate subgradient method for nonsmooth convex minimization
Mathematical Programming | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3898620 (Why is no real title available?)
| 1983-01-01 | Paper |
