Pages that link to "Item:Q3039046"

The following pages link to An aggregate subgradient method for nonsmooth convex minimization (Q3039046):

Displaying 50 items.

• Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
• Nonconvex bundle method with application to a delamination problem (Q316176) (← links)
• Approximate level method for nonsmooth convex minimization (Q415377) (← links)
• An adaptive competitive penalty method for nonsmooth constrained optimization (Q526728) (← links)
• Two-direction subgradient method for non-differentiable optimization problems (Q581239) (← links)
• Untangling of 2D meshes in ALE simulations (Q598423) (← links)
• Cutting plane oracles to minimize non-smooth non-convex functions (Q618887) (← links)
• Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
• Convergence of a generalized subgradient method for nondifferentiable convex optimization (Q757242) (← links)
• A matrix generation approach for eigenvalue optimization (Q868452) (← links)
• Solving large-scale semidefinite programs in parallel (Q868469) (← links)
• A bundle modification strategy for convex minimization (Q869143) (← links)
• Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
• A parallel interior point decomposition algorithm for block angular semidefinite programs (Q969720) (← links)
• A proximal cutting plane method using Chebychev center for nonsmooth convex optimization (Q1013976) (← links)
• Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications (Q1013981) (← links)
• A method for minimizing the sum of a convex function and a continuously differentiable function (Q1057185) (← links)
• An algorithm for linearly constrained convex nondifferentiable minimization problems (Q1058460) (← links)
• Decomposition method of descent for minimizing the sum of convex nonsmooth functions (Q1071652) (← links)
• An aggregate subgradient method for nonsmooth and nonconvex minimization (Q1082780) (← links)
• On Poljak's improved subgradient method (Q1090617) (← links)
• A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
• Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
• A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
• Subgradient algorithm on Riemannian manifolds (Q1264990) (← links)
• Convergence analysis of some methods for minimizing a nonsmooth convex function (Q1265007) (← links)
• Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results (Q1319860) (← links)
• Nonmonotone bundle-type scheme for convex nonsmooth minimization (Q1321299) (← links)
• Convergence of some algorithms for convex minimization (Q1321649) (← links)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• A surrogate heuristic for set covering problems (Q1342046) (← links)
• \(r\)-algorithms and ellipsoids (Q1364116) (← links)
• Infeasible predictor-corrector interior-point method applied to image restoration in the presence of noise (Q1573984) (← links)
• Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints (Q1630269) (← links)
• Non-smooth optimization for robust control of infinite-dimensional systems (Q1653334) (← links)
• Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs (Q1730809) (← links)
• Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
• A direct method of linearization for continuous minimax problems (Q1821697) (← links)
• A generalized subgradient method with relaxation step (Q1914075) (← links)
• New variants of bundle methods (Q1922693) (← links)
• Scenario decomposition of risk-averse multistage stochastic programming problems (Q1931651) (← links)
• Notoriously hard (mixed-)binary QPs: empirical evidence on new completely positive approaches (Q2010370) (← links)
• A new method based on the proximal bundle idea and gradient sampling technique for minimizing nonsmooth convex functions (Q2023656) (← links)
• Stochastic dynamic cutting plane for multistage stochastic convex programs (Q2032005) (← links)
• A non-monotone conjugate subgradient type method for minimization of convex functions (Q2302755) (← links)
• Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes (Q2399479) (← links)
• Rate of convergence of the bundle method (Q2412838) (← links)
• Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
• Proximal bundle methods based on approximate subgradients for solving Lagrangian duals of minimax fractional programs (Q2423806) (← links)