Pages that link to "Item:Q1321649"

The following pages link to Convergence of some algorithms for convex minimization (Q1321649):

Displaying 50 items.

• Linear convergence of epsilon-subgradient descent methods for a class of convex functions (Q1806023) (← links)
• Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
• On convergence of minimization methods: Attraction, repulsion, and selection (Q1841569) (← links)
• Convergence for stabilisation of degenerately convex minimisation problems (Q1880400) (← links)
• Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
• A quasi-second-order proximal bundle algorithm (Q1915808) (← links)
• A convergence analysis for a convex version of Dikin's algorithm (Q1915918) (← 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)
• Descentwise inexact proximal algorithms for smooth optimization (Q1935582) (← links)
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
• Conjugate gradient type methods for the nondifferentiable convex minimization (Q1941196) (← links)
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
• A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization (Q2007826) (← links)
• Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
• A filter proximal bundle method for nonsmooth nonconvex constrained optimization (Q2022218) (← links)
• A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
• An inertial algorithm for DC programming (Q2281267) (← links)
• An approximate bundle method for solving nonsmooth equilibrium problems (Q2399480) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• A simple version of bundle method with linear programming (Q2419511) (← links)
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)
• Lagrangian relaxations on networks by \(\varepsilon \)-subgradient methods (Q2429403) (← links)
• Approximate subgradient methods for nonlinearly constrained network flow problems (Q2499376) (← links)
• A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
• Fast proximal algorithms for nonsmooth convex optimization (Q2661564) (← links)
• A subgradient method with non-monotone line search (Q2696908) (← links)
• A modified conjugate gradient method for general convex functions (Q2699981) (← links)
• A strongly convergent proximal bundle method for convex minimization in Hilbert spaces (Q2790873) (← links)
• Projection Methods in Conic Optimization (Q2802538) (← links)
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
• Scaling techniques for \(\epsilon\)-subgradient methods (Q2817840) (← links)
• Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints (Q2845108) (← links)
• First-order and second-order optimality conditions for nonsmooth constrained problems via convolution smoothing (Q2996801) (← links)
• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) (← links)
• Algorithms for quasiconvex minimization (Q3112506) (← links)
• First Order Methods for Optimization on Riemannian Manifolds (Q3300552) (← links)
• A convergence analysis result for constrained convex minimization problem (Q3453420) (← links)
• Approximate Subgradient Methods for Lagrangian Relaxations on Networks (Q3557823) (← links)
• A note on the convergence of an inertial version of a diagonal hybrid projection-point algorithm (Q3577847) (← links)
• Convergence of a numerical abstract convexity algorithm (Q3626973) (← links)
• (Q3703213) (← links)
• On the Convergence of the Proximal Point Algorithm for Convex Minimization (Q3978027) (← links)
• (Q4211841) (← links)
• (Q4309850) (← links)
• DYNAMICAL ADJUSTMENT OF THE PROX-PARAMETER IN BUNDLE METHODS (Q4548051) (← links)
• Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
• Convergence of a proximal algorithm for solving the dual of a generalized fractional program (Q4578155) (← links)
• Incremental Bundle Methods using Upper Models (Q4603045) (← links)