Conditional subgradient optimization -- theory and applications
From MaRDI portal
Recommendations
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part II: Implementations and Extensions
- Two ``well-known properties of subgradient optimization
- Ergodic convergence in subgradient optimization
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
Cites work
- \(\epsilon\)-subgradient projection algorithm
- A Descent Numerical Method for Optimization Problems with Nondifferentiable Cost Functionals
- A Necessary and Sufficient Qualification for Constrained Optimization
- A reduced subgradient algorithm
- Advanced start for the multicommodity network flow problem
- An active set method for solving linearly constrained nonsmooth optimization problems
- An approach to nonlinear programming
- An Effective Subgradient Procedure for Minimal Cost Multicommodity Flow Problems
- An O(n) algorithm for quadratic knapsack problems
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- scientific article; zbMATH DE number 3972625 (Why is no real title available?)
- scientific article; zbMATH DE number 4063877 (Why is no real title available?)
- scientific article; zbMATH DE number 3670211 (Why is no real title available?)
- scientific article; zbMATH DE number 3721593 (Why is no real title available?)
- scientific article; zbMATH DE number 3724209 (Why is no real title available?)
- scientific article; zbMATH DE number 3557512 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3628731 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 599411 (Why is no real title available?)
- scientific article; zbMATH DE number 3441150 (Why is no real title available?)
- scientific article; zbMATH DE number 3894826 (Why is no real title available?)
- scientific article; zbMATH DE number 3282977 (Why is no real title available?)
- scientific article; zbMATH DE number 3356467 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Improving feasible directions for a class of nondifferentiable functions
- Minimization of unsmooth functionals
- Nondifferentiable optimization. Transl. from the Russian by Tetsushi Sasagawa
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- On the Identification of Active Constraints
- Polyak's subgradient method with simplified projection for nondifferentiable optimization with linear constraints
- Simplicial decomposition in nonlinear programming algorithms
- Subdifferentials of functions on sets
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
- Weak Sharp Minima in Mathematical Programming
- ε-Optimal solutions in nondifferentiable convex programming and some related questions
Cited in
(40)- Two ``well-known properties of subgradient optimization
- A subgradient method for solving multiproduct network development problems with survivability guarantees
- Subgradient method with entropic projections for convex nondifferentiable minimization
- On the convergence of conditional -subgradient methods for convex programs and convex-concave saddle-point problems.
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- Lagrangean/surrogate relaxation for generalized assignment problems
- Solving Euclidean distance multifacility location problems using conjugate subgradient and line-search methods
- A primal-dual subgradient method for time staged capacity expansion planning
- Accelerating the convergence of subgradient optimisation
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Management of wind power variations in electricity system investment models. A parallel computing strategy
- Convex optimization with an interpolation-based projection and its application to deep learning
- Optimal design of differentiated credit charging links in mixed-autonomy transportation networks
- A viscosity method with no spectral radius requirements for the split common fixed point problem
- Lagrangian relaxation and pegging test for the clique partitioning problem
- Fixed point quasiconvex subgradient method
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- Rescheduling optimization of steelmaking-continuous casting process based on the Lagrangian heuristic algorithm
- A survey on the continuous nonlinear resource allocation problem
- Inexact subgradient methods for quasi-convex optimization problems
- On the convergence of the forward-backward splitting method with linesearches
- Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints
- A Geometrically Convergent Subgradient Optimization Method for Nonlinearly Constrained Convex Programs
- Numerical methods for stochastic programs with second order dominance constraints with applications to portfolio optimization
- A dual scheme for traffic assignment problems
- Ergodic convergence in subgradient optimization
- An infeasible-point subgradient method using adaptive approximate projections
- Method of conditional ?-subgradient for solving convex programming problems
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- Solving basis pursuit: heuristic optimality check and solver comparison
- Lagrangean relaxation-based techniques for solving facility location problems
- A modified subgradient algorithm for Lagrangean relaxation
- Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution
- Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models
- Accelerating level-value adjustment for the Polyak stepsize
- Convergence rates of subgradient methods for quasi-convex optimization problems
This page was built for publication: Conditional subgradient optimization -- theory and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266608)
