Pages that link to "Item:Q1321649"
From MaRDI portal
The following pages link to Convergence of some algorithms for convex minimization (Q1321649):
Displaying 50 items.
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations (Q255074) (← links)
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← links)
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems (Q295480) (← links)
- Composite proximal bundle method (Q359623) (← links)
- Solving generation expansion planning problems with environmental constraints by a bundle method (Q373184) (← links)
- First-order methods of smooth convex optimization with inexact oracle (Q403634) (← links)
- A decomposition algorithm for convex nondifferentiable minimization with errors (Q410890) (← links)
- A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
- Convex proximal bundle methods in depth: a unified analysis for inexact oracles (Q484139) (← links)
- Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
- Convergence of the approximate auxiliary problem method for solving generalized variational inequalities (Q704756) (← links)
- A quasi-Newton bundle method based on approximate subgradients (Q874359) (← links)
- Computing proximal points of nonconvex functions (Q959941) (← links)
- A bundle method for solving equilibrium problems (Q959957) (← links)
- An approximate decomposition algorithm for convex minimization (Q966076) (← links)
- A new trust region algorithm for nonsmooth convex minimization (Q990576) (← links)
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization (Q1005145) (← links)
- An approximate bundle-type auxiliary problem method for solving generalized variational inequalities (Q1007656) (← links)
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Two ``well-known'' properties of subgradient optimization (Q1016352) (← links)
- An inexact proximal point method for solving generalized fractional programs (Q1024832) (← links)
- Subgradient methods for saddle-point problems (Q1035898) (← links)
- A proximal approach to the inversion of ill-conditioned matrices (Q1046553) (← links)
- Subgradient algorithm on Riemannian manifolds (Q1264990) (← links)
- Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space (Q1290597) (← links)
- Variable metric bundle methods: From conceptual to implementable forms (Q1356052) (← links)
- Convergence analysis of gradient descent stochastic algorithms (Q1359455) (← links)
- Sample-path optimization of convex stochastic performance functions (Q1363424) (← links)
- Some convergence properties of descent methods (Q1372548) (← links)
- Coupling the proximal point algorithm with approximation methods (Q1379933) (← links)
- On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
- Globally convergent BFGS method for nonsmooth convex optimization (Q1573986) (← links)
- Efficiency of proximal bundle methods (Q1573991) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- Multivariate spectral gradient algorithm for nonsmooth convex optimization problems (Q1664763) (← links)
- A new proximal Chebychev center cutting plane algorithm for nonsmooth optimization and its convergence (Q1717026) (← links)
- An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems (Q1717575) (← links)
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
- On the proximal gradient algorithm with alternated inertia (Q1752647) (← links)
- Nonsmooth nonconvex global optimization in a Banach space with a basis (Q1767923) (← links)
- Regularized decomposition of large scale block-structured robust optimization problems (Q1789623) (← links)
- An effective adaptive trust region algorithm for nonsmooth minimization (Q1790684) (← links)
- A family of variable metric proximal methods (Q1804367) (← links)
- Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
- A note on locally Lipschitzian functions (Q1919809) (← links)
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration (Q1932983) (← links)
