Pages that link to "Item:Q2784405"

The following pages link to Incremental Subgradient Methods for Nondifferentiable Optimization (Q2784405):

Displaying 50 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• A novel Lagrangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process (Q299834) (← links)
• A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces (Q300769) (← links)
• Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
• Proximal point algorithms for nonsmooth convex optimization with fixed point constraints (Q323195) (← links)
• The proximal Chebychev center cutting plane algorithm for convex additive functions (Q359628) (← links)
• A subgradient method for multiobjective optimization on Riemannian manifolds (Q382921) (← links)
• A direct splitting method for nonsmooth variational inequalities (Q398641) (← links)
• Subgradient method for convex feasibility on Riemannian manifolds (Q415385) (← links)
• An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
• Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions (Q507334) (← links)
• A distributed hierarchical algorithm for multi-cluster constrained optimization (Q510122) (← links)
• Distributed stochastic subgradient projection algorithms for convex optimization (Q620442) (← links)
• Random algorithms for convex minimization problems (Q644912) (← links)
• Incremental proximal methods for large scale convex optimization (Q644913) (← links)
• Near-optimal stochastic approximation for online principal component estimation (Q681490) (← links)
• Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
• Discrete-time gradient flows and law of large numbers in Alexandrov spaces (Q745561) (← links)
• Generalized gradient learning on time series (Q747282) (← links)
• Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
• Communication-reducing algorithm of distributed least mean square algorithm with neighbor-partial diffusion (Q831586) (← links)
• On solving the Lagrangian dual of integer programs via an incremental approach (Q849073) (← links)
• Spectral projected subgradient with a momentum term for the Lagrangean dual approach (Q878598) (← links)
• A decomposition-based solution method for stochastic mixed integer nonlinear programs (Q882650) (← links)
• A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
• Incremental-like bundle methods with application to energy planning (Q975362) (← links)
• The stochastic trim-loss problem (Q1011257) (← links)
• Subgradient methods for saddle-point problems (Q1035898) (← links)
• Dual decomposition for multi-agent distributed optimization with coupling constraints (Q1680912) (← links)
• Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
• On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
• An incremental subgradient method on Riemannian manifolds (Q1752648) (← links)
• An effective line search for the subgradient method (Q1781859) (← links)
• Modified Fejér sequences and applications (Q1790672) (← links)
• Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622) (← links)
• Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
• The effect of deterministic noise in subgradient methods (Q1960191) (← links)
• Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
• Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems (Q2010107) (← links)
• Gradient-free method for nonsmooth distributed optimization (Q2018475) (← links)
• A decentralized multi-objective optimization algorithm (Q2032002) (← links)
• Incremental without replacement sampling in nonconvex optimization (Q2046568) (← links)
• Variable smoothing incremental aggregated gradient method for nonsmooth nonconvex regularized optimization (Q2047203) (← links)
• Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
• Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
• Accelerating incremental gradient optimization with curvature information (Q2181597) (← links)
• An incremental bundle method for portfolio selection problem under second-order stochastic dominance (Q2200800) (← links)
• Primal-dual incremental gradient method for nonsmooth and convex optimization problems (Q2230784) (← links)
• On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling (Q2235138) (← links)
• Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)