The following pages link to (Q3141900):
Displaying 50 items.
- Regularization parameter selection for the low rank matrix recovery (Q2046538) (← links)
- A strongly convergent proximal point method for vector optimization (Q2046562) (← links)
- A stochastic primal-dual method for optimization with conditional value at risk constraints (Q2046691) (← links)
- Optimality conditions for nonconvex problems over nearly convex feasible sets (Q2048940) (← links)
- On Bayesian posterior mean estimators in imaging sciences and Hamilton-Jacobi partial differential equations (Q2051535) (← links)
- On global subdifferentials with applications in nonsmooth optimization (Q2052399) (← links)
- Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions (Q2053269) (← links)
- On the strong law of large numbers for \(\phi \)-sub-Gaussian random variables (Q2057630) (← links)
- Quadrilateral-area-coordinate-based numerical manifold method accommodating static and dynamic analysis (Q2058126) (← links)
- A sufficient condition for asymptotically well behaved property of convex polynomials (Q2060600) (← links)
- Steering the aggregative behavior of noncooperative agents: a nudge framework (Q2063772) (← links)
- Best approximation of functions by log-polynomials (Q2067052) (← links)
- Copositivity meets D. C. optimization (Q2068809) (← links)
- A generalisation of de la Vallée-Poussin procedure to multivariate approximations (Q2070294) (← links)
- Differential stability properties in convex scalar and vector optimization (Q2070403) (← links)
- Superquantiles at work: machine learning applications and efficient subgradient computation (Q2070410) (← links)
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization (Q2077957) (← links)
- Optimality conditions and duality for multiobjective semi-infinite programming on Hadamard manifolds (Q2079806) (← links)
- Regularity of a distribution and of the boundary of its support (Q2082311) (← links)
- Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization (Q2089785) (← links)
- A generalized block-iterative projection method for the common fixed point problem induced by cutters (Q2089887) (← links)
- On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization (Q2091085) (← links)
- Structure of optimal policies to periodic-review inventory models with convex costs and backorders for all values of discount factors (Q2095188) (← links)
- On the optimality equation for average cost Markov decision processes and its validity for inventory control (Q2095219) (← links)
- A new mathematical formulation of the equations of perfect elasto-plasticity (Q2096968) (← links)
- Study of semilocal convergence analysis of Chebyshev's method under new type majorant conditions (Q2101698) (← links)
- Linear convergence of a nonmonotone projected gradient method for multiobjective optimization (Q2114598) (← links)
- \(\rho\)-regularization subproblems: strong duality and an eigensolver-based algorithm (Q2114814) (← links)
- A local search scheme for the inequality-constrained optimal control problem (Q2117613) (← links)
- Dissecting the duality gap: the supporting hyperplane interpretation revisited (Q2119761) (← links)
- On some neural network architectures that can represent viscosity solutions of certain high dimensional Hamilton-Jacobi partial differential equations (Q2123971) (← links)
- Gaining or losing perspective (Q2124806) (← links)
- On iteration complexity of a first-order primal-dual method for nonlinear convex cone programming (Q2136507) (← links)
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces (Q2138397) (← links)
- An inertial S-iteration process for a common fixed point of a family of quasi-Bregman nonexpansive mappings (Q2138472) (← links)
- Characterizations of the set less order relation in nonconvex set optimization (Q2139270) (← links)
- A primal-dual algorithm for nonnegative \(N\)-th order CP tensor decomposition: application to fluorescence spectroscopy data analysis (Q2146528) (← links)
- Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry (Q2149561) (← links)
- Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints (Q2150784) (← links)
- Classification in the multiple instance learning framework via spherical separation (Q2152886) (← links)
- On Hamilton-Jacobi PDEs and image denoising models with certain nonadditive noise (Q2155172) (← links)
- Necessary optimality conditions for nonsmooth multi-objective bilevel optimization problem under the optimistic perspective (Q2156713) (← links)
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives (Q2165600) (← links)
- A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
- Globally minimizing the sum of a convex-concave fraction and a convex function based on wave-curve bounds (Q2176280) (← links)
- A proof of the Caffarelli contraction theorem via entropic regularization (Q2180862) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- A neurodynamic approach to nonlinear optimization problems with affine equality and convex inequality constraints (Q2182907) (← links)
- The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications (Q2190318) (← links)
- The multiproximal linearization method for convex composite problems (Q2191762) (← links)
