Numerical methods for nondifferentiable convex optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1488009
- A numerical method of nondifferentiable convex optimization with constraints
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- scientific article; zbMATH DE number 4030850
- A method for minimizing convex functions based on continuous approximations to the subdifferential
Cited in
(76)- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- Penalty-proximal methods in convex programming
- A constraint linearization method for nondifferentiable convex minimization
- A successive quadratic programming method for a class of constrained nonsmooth optimization problems
- Convergence analysis of some methods for minimizing a nonsmooth convex function
- Prox-regularization and solution of ill-posed elliptic variational inequalities
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- The perturbed proximal point algorithm and some of its applications
- Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
- Descent algorithm for a class of convex nondifferentiable functions
- Nonmonotone bundle-type scheme for convex nonsmooth minimization
- Convergence of some algorithms for convex minimization
- A proximal-based deomposition method for compositions method for convex minimization problems
- Variable metric bundle methods: From conceptual to implementable forms
- Coupling the proximal point algorithm with approximation methods
- Globally convergent BFGS method for nonsmooth convex optimization
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- An effective adaptive trust region algorithm for nonsmooth minimization
- A family of variable metric proximal methods
- A continuation method for monotone variational inequalities
- Generalized proximal point algorithm for convex optimization
- A quasi-second-order proximal bundle algorithm
- Family of perturbation methods for variational inequalities
- A descent method with linear programming subproblems for nondifferentiable convex optimization
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- Conjugate gradient type methods for the nondifferentiable convex minimization
- Theoretical aspect of diagonal Bregman proximal methods
- Inexact version of Bregman proximal gradient algorithm
- Convergence rates of accelerated proximal gradient algorithms under independent noise
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
- Convex optimization by radial search
- Inexact proximal point algorithms and descent methods in optimization
- A \(\mathcal{VU}\)-algorithm for convex minimization
- A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
- Fast proximal algorithms for nonsmooth convex optimization
- Epsilon-proximal point algorithms for nondifferentiable convex optimization problems and applications
- An ODE-like nonmonotone method for nonsmooth convex optimization
- scientific article; zbMATH DE number 3851875 (Why is no real title available?)
- On the possibility of applying smooth methods to the solution of non- smooth optimization problems
- An optimal variant of Kelley's cutting-plane method
- scientific article; zbMATH DE number 4162666 (Why is no real title available?)
- The proximal Chebychev center cutting plane algorithm for convex additive functions
- scientific article; zbMATH DE number 4030850 (Why is no real title available?)
- A feasible directions method for nonsmooth convex optimization
- scientific article; zbMATH DE number 151654 (Why is no real title available?)
- A decomposition algorithm for convex nondifferentiable minimization with errors
- scientific article; zbMATH DE number 1264396 (Why is no real title available?)
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Method of conjugate subgradients with constrained memory
- scientific article; zbMATH DE number 195045 (Why is no real title available?)
- The perturbed Tikhonov's algorithm and some of its applications
- About saddle values of a class of convex-concave functions
- Survey of Bundle Methods for Nonsmooth Optimization
- Multi-step-prox-regularization method for solving convex variation problems
- Hybrid extragradient proximal algorithm coupled with parametric approximation and penalty/barrier methods
- Numerical Nonsmooth Optimization
- A memory gradient method for non-smooth convex optimization
- Globally convergent cutting plane method for nonconvex nonsmooth minimization
- Essentials of numerical nonsmooth optimization
- A decomposition method for convex minimization problems and its application.
- Numerical approximation of non-homogeneous, non-convex vector variational problems
- Robustness of the hybrid extragradient proximal-point algorithm.
- Minimizing and stationary sequences of convex constrained minimization problems
- Essentials of numerical nonsmooth optimization
- Accelerated differential inclusion for convex optimization
- Principled analyses and design of first-order methods with inexact proximal operators
- Alternating proximal algorithms for linearly constrained variational inequalities: application to domain decomposition for PDE's
- A numerical method of nondifferentiable convex optimization with constraints
- On the diagonal proximal point algorithms
- Synthesis of cutting and separating planes in a nonsmooth optimization method
- Proximity control in bundle methods for convex nondifferentiable minimization
- Computing proximal points of nonconvex functions
- A bundle-filter method for nonsmooth convex constrained optimization
This page was built for publication: Numerical methods for nondifferentiable convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4726049)
