Pages that link to "Item:Q5033059"
From MaRDI portal
The following pages link to Modern Nonconvex Nondifferentiable Optimization (Q5033059):
Displaying 15 items.
- Nonconvex and nonsmooth approaches for affine chance-constrained stochastic programs (Q2158841) (← links)
- Linear-step solvability of some folded concave and singly-parametric sparse optimization problems (Q2693645) (← links)
- Solving Nonsmooth and Nonconvex Compound Stochastic Programs with Applications to Risk Measure Minimization (Q5870366) (← links)
- New Bregman proximal type algoritms for solving DC optimization problems (Q6043133) (← links)
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound (Q6051308) (← links)
- A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective (Q6093282) (← links)
- Rational Generalized Nash Equilibrium Problems (Q6116245) (← links)
- Comparing solution paths of sparse quadratic minimization with a Stieltjes matrix (Q6120849) (← links)
- (Q6137264) (← links)
- Consistent approximations in composite optimization (Q6165588) (← links)
- A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions (Q6188504) (← links)
- Incremental quasi-Newton algorithms for solving a nonconvex, nonsmooth, finite-sum optimization problem (Q6586914) (← links)
- Towards global solutions for nonconvex two-stage stochastic programs: a polynomial lower approximation approach (Q6622759) (← links)
- No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians (Q6634520) (← links)
- A unified Bregman alternating minimization algorithm for generalized DC programs with application to imaging (Q6639517) (← links)
