Pages that link to "Item:Q1774171"
From MaRDI portal
The following pages link to Non-Euclidean restricted memory level method for large-scale convex optimization (Q1774171):
Displaying 42 items.
- A doubly stabilized bundle method for nonsmooth convex optimization (Q263188) (← 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)
- Subgradient methods for huge-scale optimization problems (Q403646) (← links)
- An optimal method for stochastic composite optimization (Q431018) (← links)
- Approximation bounds for sparse principal component analysis (Q484129) (← links)
- Dual subgradient algorithms for large-scale nonsmooth learning problems (Q484132) (← links)
- Diagonal bundle method for nonsmooth sparse optimization (Q495735) (← links)
- Scaled memoryless symmetric rank one method for large-scale optimization (Q720629) (← links)
- Level bundle-like algorithms for convex optimization (Q743968) (← links)
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)
- An inexact bundle variant suited to column generation (Q1016116) (← links)
- Accelerated schemes for a class of variational inequalities (Q1680963) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Target radius methods for nonsmooth convex optimization (Q1728379) (← 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)
- An outer-approximation guided optimization approach for constrained neural network inverse problems (Q2097633) (← links)
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game (Q2117635) (← links)
- Proximal bundle methods for nonsmooth DC programming (Q2274891) (← links)
- A non-Euclidean gradient descent method with sketching for unconstrained matrix minimization (Q2294351) (← links)
- Generalized uniformly optimal methods for nonlinear programming (Q2316202) (← links)
- On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems (Q2322551) (← links)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization (Q2425996) (← links)
- Partial Lagrangian relaxation for the unbalanced orthogonal Procrustes problem (Q2454077) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- Stochastic first-order methods for convex and nonconvex functional constrained optimization (Q2689819) (← links)
- Adaptive limited memory bundle method for bound constrained large-scale nonsmooth optimization (Q2786335) (← links)
- Subgradient and Bundle Methods for Nonsmooth Optimization (Q2838345) (← links)
- A non-monotonic method for large-scale non-negative least squares (Q2867422) (← links)
- Comparing different nonsmooth minimization methods and software (Q2885467) (← links)
- Level bundle methods for oracles with on-demand accuracy (Q2926079) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- On a Solving Bilevel D.C.-Convex Optimization Problems (Q4965111) (← links)
- Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support (Q5003210) (← links)
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes (Q5013585) (← links)
- Accelerated Stochastic Algorithms for Convex-Concave Saddle-Point Problems (Q5085148) (← links)
- Simple and Optimal Methods for Stochastic Variational Inequalities, I: Operator Extrapolation (Q5097022) (← links)
- Solving variational inequalities with Stochastic Mirror-Prox algorithm (Q5168840) (← links)
- On the generalization of ECP and OA methods to nonsmooth convex MINLP problems (Q5495574) (← links)
- Graph Topology Invariant Gradient and Sampling Complexity for Decentralized and Stochastic Optimization (Q6116247) (← links)
