The following pages link to (Q4830373):
Displaying 50 items.
- Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning (Q2045021) (← links)
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints (Q2046540) (← links)
- An exact handling of the gradient for overcoming persistent problems in nonlinear observer design via convex optimization techniques (Q2049249) (← links)
- Design of optimal utility of wireless rechargeable sensor networks via joint spatiotemporal scheduling (Q2049741) (← links)
- Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression (Q2057761) (← links)
- A constrained consensus based optimization algorithm and its application to finance (Q2060189) (← links)
- Fast global minimization of the Chan-Vese model for image segmentation problem (Q2065422) (← links)
- A convergent finite difference method for computing minimal Lagrangian graphs (Q2075874) (← links)
- Event-based model predictive control for nonlinear systems with dynamic disturbance (Q2081826) (← links)
- Uncertainty quantification of the 4th kind; optimal posterior accuracy-uncertainty tradeoff with the minimum enclosing ball (Q2088318) (← links)
- An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods (Q2089775) (← links)
- Decomposition of completely symmetric states (Q2105996) (← links)
- Dissecting the duality gap: the supporting hyperplane interpretation revisited (Q2119761) (← links)
- Local saddle points for unconstrained polynomial optimization (Q2125068) (← links)
- On scaled stopping criteria for a safeguarded augmented Lagrangian method with theoretical guarantees (Q2125571) (← links)
- A survey on some recent developments of alternating direction method of multipliers (Q2136506) (← links)
- Convergence of inexact quasisubgradient methods with extrapolation (Q2139278) (← links)
- Convergence of two simple methods for solving monotone inclusion problems in reflexive Banach spaces (Q2145667) (← links)
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems (Q2154446) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- A common solution of generalized equilibrium, zeros of monotone mapping and fixed point problems (Q2159201) (← links)
- An extended delayed weighted gradient algorithm for solving strongly convex optimization problems (Q2161068) (← links)
- The saddle point problem of polynomials (Q2162120) (← links)
- A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs (Q2181641) (← links)
- Non-indexability of the stochastic appointment scheduling problem (Q2188257) (← links)
- Sign projected gradient flow: a continuous-time approach to convex optimization with linear equality constraints (Q2203094) (← links)
- Convergence results of forward-backward method for a zero of the sum of maximally monotone mappings in Banach spaces (Q2204145) (← links)
- Properties of the sign gradient descent algorithms (Q2214992) (← links)
- Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems (Q2222129) (← links)
- Primal-dual incremental gradient method for nonsmooth and convex optimization problems (Q2230784) (← links)
- Strongly stable C-stationary points for mathematical programs with complementarity constraints (Q2230944) (← links)
- Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization (Q2231331) (← links)
- \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
- Approximation of a common \(f\)-fixed point of \(f\)-pseudocontractive mappings in Banach spaces (Q2243639) (← links)
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks (Q2248745) (← links)
- Linearization-based algorithms for mixed-integer nonlinear programs with convex continuous relaxation (Q2250087) (← links)
- Homogeneous penalizers and constraints in convex image restoration (Q2251195) (← links)
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
- Fixed point quasiconvex subgradient method (Q2282530) (← links)
- Primal-dual splitting method for high-order model with application to image restoration (Q2289187) (← links)
- Robustness of learning algorithms using hinge loss with outlier indicators (Q2292231) (← links)
- A spectral method of the analysis of linear control systems (Q2299190) (← links)
- Decentralized hierarchical constrained convex optimization (Q2303528) (← links)
- A variational model with hybrid hyper-Laplacian priors for Retinex (Q2307152) (← links)
- Saddle points of rational functions (Q2307710) (← links)
- New regularization models for image denoising with a spatially dependent regularization parameter (Q2319033) (← links)
- Deep relaxation: partial differential equations for optimizing deep neural networks (Q2319762) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Optimal utilization of ports' free-of-charge times in one distribution center and multiple ports inventory systems (Q2325145) (← links)
