The following pages link to (Q3452586):
Displaying 50 items.
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods (Q507324) (← links)
- Proximal algorithms and temporal difference methods for solving fixed point problems (Q721950) (← links)
- Lectures on convex optimization (Q723525) (← links)
- An attention algorithm for solving large scale structured \(l_0\)-norm penalty estimation problems (Q825333) (← links)
- A convex optimization approach to dynamic programming in continuous state and action spaces (Q831365) (← links)
- Distributed sub-optimal resource allocation over weight-balanced graph via singular perturbation (Q1626886) (← links)
- Robust pooling for contracting models with asymmetric information (Q1631526) (← links)
- Finite-horizon covariance control for discrete-time stochastic linear systems subject to input constraints (Q1641047) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution (Q1655360) (← links)
- On convergence rates of game theoretic reinforcement learning algorithms (Q1737909) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations (Q1785197) (← links)
- Nash bargaining solution based rendezvous guidance of unmanned aerial vehicles (Q1796756) (← links)
- Tighter McCormick relaxations through subgradient propagation (Q2010084) (← links)
- Generalized polyhedral convex optimization problems (Q2010093) (← links)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
- Resolving learning rates adaptively by locating stochastic non-negative associated gradient projection points using line searches (Q2022225) (← links)
- Construction of constrained experimental designs on finite spaces for a modified \(\mathrm{E}_k\)-optimality criterion (Q2023572) (← links)
- An iterative dynamic programming approach for the temporal knapsack problem (Q2030285) (← links)
- Robust stochastic optimization with convex risk measures: a discretized subgradient scheme (Q2031316) (← links)
- Multi-stage distributionally robust optimization with risk aversion (Q2031326) (← links)
- Incremental without replacement sampling in nonconvex optimization (Q2046568) (← links)
- Sparse group fused Lasso for model segmentation: a hybrid approach (Q2051576) (← links)
- Distributed decision-coupled constrained optimization via proximal-tracking (Q2059328) (← links)
- Asynchronous networked aggregative games (Q2063821) (← links)
- A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
- Adaptive optimization with periodic dither signals (Q2070015) (← links)
- Convex optimization with an interpolation-based projection and its application to deep learning (Q2071365) (← links)
- Optimal sensor placement for joint parameter and state estimation problems in large-scale dynamical systems with applications to thermo-mechanics (Q2071419) (← links)
- Quasi-convex feasibility problems: subgradient methods and convergence rates (Q2076909) (← links)
- Curiosities and counterexamples in smooth convex optimization (Q2089782) (← links)
- Active channel sparsification: realizing frequency-division duplexing massive MIMO with minimal overhead (Q2106487) (← links)
- Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems (Q2129140) (← links)
- Accelerated proximal gradient method for bi-modulus static elasticity (Q2138312) (← links)
- A dynamic alternating direction of multipliers for nonconvex minimization with nonlinear functional equality constraints (Q2139259) (← links)
- Interior quasi-subgradient method with non-Euclidean distances for constrained quasi-convex optimization problems in Hilbert spaces (Q2141725) (← links)
- Improved linear regression prediction by transfer learning (Q2157516) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- A regularized alternating least-squares method for minimizing a sum of squared Euclidean norms with rank constraint (Q2162388) (← links)
- The \(p\)-Lagrangian relaxation for separable nonconvex MIQCQP problems (Q2162511) (← links)
- Sufficient conditions for existence of global minimizers of functions on Hilbert spaces (Q2162518) (← links)
- Distributed algorithms for convex problems with linear coupling constraints (Q2173513) (← links)
- Predictive online convex optimization (Q2173950) (← links)
- Diffusion generated methods for denoising target-valued images (Q2176514) (← links)
- Randomness and permutations in coordinate descent methods (Q2189444) (← links)
- Towards an efficient augmented Lagrangian method for convex quadratic programming (Q2191789) (← links)
- Why random reshuffling beats stochastic gradient descent (Q2227529) (← links)
- Frank-Wolfe and friends: a journey into projection-free first-order optimization methods (Q2240671) (← links)
