Pages that link to "Item:Q1922692"

The following pages link to Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities (Q1922692):

Displaying 47 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)
• Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study (Q297279) (← links)
• Applications of gauge duality in robust principal component analysis and semidefinite programming (Q341322) (← links)
• An optimal variant of Kelley's cutting-plane method (Q344947) (← links)
• Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
• Level bundle methods for constrained convex optimization with various oracles (Q404512) (← links)
• A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization (Q429459) (← links)
• New bundle methods for solving Lagrangian relaxation dual problems (Q700752) (← links)
• Level bundle-like algorithms for convex optimization (Q743968) (← links)
• Stochastic hydro-thermal unit commitment via multi-level scenario trees and bundle regularization (Q779756) (← links)
• A bundle modification strategy for convex minimization (Q869143) (← links)
• A bundle method for solving equilibrium problems (Q959957) (← links)
• An inexact bundle variant suited to column generation (Q1016116) (← links)
• On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems. (Q1410305) (← links)
• Efficiency of proximal bundle methods (Q1573991) (← links)
• Target radius methods for nonsmooth convex optimization (Q1728379) (← links)
• Interior proximal method for variational inequalities: Case of nonparamonotone operators (Q1771256) (← links)
• Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171) (← links)
• Finding normal solutions in piecewise linear programming (Q1900115) (← links)
• Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization (Q1938913) (← links)
• A modified nonlinear conjugate gradient algorithm for large-scale nonsmooth convex optimization (Q1985287) (← links)
• Visualization of the \(\varepsilon \)-subdifferential of piecewise linear-quadratic functions (Q2013149) (← links)
• Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization (Q2023658) (← links)
• A limited memory BFGS subspace algorithm for bound constrained nonsmooth problems (Q2069440) (← links)
• A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
• Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
• Asynchronous level bundle methods (Q2205980) (← links)
• A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs (Q2252688) (← links)
• Using regularization and second order information in outer approximation for convex MINLP (Q2297649) (← links)
• On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
• Piecewise linear approximations in nonconvex nonsmooth optimization (Q2391130) (← links)
• Rate of convergence of the bundle method (Q2412838) (← links)
• Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
• Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
• Splitting-type method for systems of variational inequalities (Q2567177) (← links)
• Fast proximal algorithms for nonsmooth convex optimization (Q2661564) (← links)
• General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) (← links)
• A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
• A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes (Q5013585) (← links)
• Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse (Q5131710) (← links)
• Minimizing Piecewise-Concave Functions Over Polyhedra (Q5219555) (← links)
• (Q5389783) (← links)
• Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization (Q5883313) (← links)
• A Bundle Trust Region Algorithm for Minimizing Locally Lipschitz Functions (Q5883328) (← links)
• Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)