A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5297402 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constraint generation algorithm for large scale linear programs using multiple-points separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: An accelerated central cutting plane algorithm for linear semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of some algorithms for convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for convex programming and Tschebyscheff approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A central cutting plane algorithm for the convex programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite quadratic problems within nonsmooth optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Bundle Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constrained optimization by adjoint based quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cutting-Plane Method for Solving Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggregate subgradient method for nonsmooth convex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of descent for nondifferentiable optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity control in bundle methods for convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cholesky dual method for proximal piecewise linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bundle Bregman proximal method for convex nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New variants of bundle methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable metric bundle methods: From conceptual to implementable forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Modified Linear Program for Columnar Methods in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity estimates of some cutting plane methods based on the analytic barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust capacity assignment in telecommunications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing a proximal algorithm for some nonlinear multicommodity flow problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to robust network design in telecommunications / rank
 
Normal rank
Property / cites work
 
Property / cites work: DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank

Revision as of 11:50, 1 July 2024

scientific article
Language Label Description Also known as
English
A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
scientific article

    Statements

    A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (English)
    0 references
    0 references
    24 April 2009
    0 references
    nonsmooth optimization
    0 references
    subgradient
    0 references
    proximal bundle methods
    0 references
    convex programming
    0 references
    0 references
    0 references
    0 references

    Identifiers