The proximal Chebychev center cutting plane algorithm for convex additive functions
From MaRDI portal
Publication:359628
DOI10.1007/S10107-012-0630-ZzbMATH Open1292.90285OpenAlexW2057698180MaRDI QIDQ359628FDOQ359628
Authors: Adam Ouorou 
Publication date: 12 August 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-012-0630-z
Recommendations
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
- Numerical methods for nondifferentiable convex optimization
- scientific article; zbMATH DE number 1778406
network flowsnondifferentiable optimizationlarge-scale convex programmingrouting problems in telecommunications
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Methods of descent for nondifferentiable optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Generalized Bundle Methods
- Proximity control in bundle methods for convex nondifferentiable minimization
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- Variable metric bundle methods: From conceptual to implementable forms
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- A bundle-type algorithm for routing in telecommunication data networks
- Mixed integer nonlinear programs featuring ``on/off constraints: convex analysis and applications
- A survey of algorithms for convex multicommodity flow problems
- Title not available (Why is that?)
- The Cutting-Plane Method for Solving Convex Programs
- Title not available (Why is that?)
- On constrained optimization by adjoint based quasi-Newton methods
- Bundle methods in stochastic optimal power management: A disaggregated approach using preconditioners
- An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems
- Incremental subgradient methods for nondifferentiable optimization
- Incremental-like bundle methods with application to energy planning
- Newton's method for convex programming and Tschebyscheff approximation
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Decomposition method of descent for minimizing the sum of convex nonsmooth functions
- A Cholesky dual method for proximal piecewise linear programming
- Solving semidefinite quadratic problems within nonsmooth optimization algorithms
- A central cutting plane algorithm for the convex programming problem
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- A new proximal decomposition algorithm for routing in telecommunication networks
- Mathematical models of the delay constrained routing problem
Cited In (2)
This page was built for publication: The proximal Chebychev center cutting plane algorithm for convex additive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q359628)
