The following pages link to Radu I. Boţ (Q261848):
Displaying 50 items.
- Sequential characterization of solutions in convex composite programming and applications to vector optimization (Q1008785) (← links)
- Regularity conditions for formulae of biconjugate functions (Q1012941) (← links)
- Enlargements of positive sets (Q1023028) (← links)
- Optimality conditions for portfolio optimization problems with convex deviation measures as objective functions (Q1026966) (← links)
- Conjugate duality in convex optimization (Q1039389) (← links)
- Existence results and gap functions for the generalized equilibrium problem with composed functions (Q1049509) (← links)
- (Q1396982) (redirect page) (← links)
- Multiobjective duality for convex-linear problems. II (Q1396983) (← links)
- Multiobjective duality for convex semidefinite programming problems (Q1431149) (← links)
- (Q1637405) (redirect page) (← links)
- Higher-order conditions for strict local Pareto minima for problems with partial order introduced by a polyhedral cone (Q1637406) (← links)
- Helping you finding an appropriate regularization process (Q1639964) (← links)
- Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms (Q1653320) (← links)
- Levenberg-Marquardt dynamics associated to variational inequalities (Q1679591) (← links)
- Set-valued minimax programming problems under generalized cone convexity (Q1696505) (← links)
- Multiobjective duality for convex ratios. (Q1856918) (← links)
- Looking for appropriate qualification conditions for subdifferential formulae and dual representations for convex risk measures (Q1935901) (← links)
- Error bound results for convex inequality systems via conjugate duality (Q1939069) (← links)
- A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems (Q1946618) (← links)
- Construction of a generalized Voronoi diagram with optimal placement of generator points based on the theory of optimal set partitioning (Q1988465) (← links)
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems (Q1991713) (← links)
- A primal-dual dynamical approach to structured convex minimization problems (Q2003941) (← links)
- On solution sets of nonlinear equations with nonsmooth operators in Hilbert space and the quasi-solution method (Q2020464) (← links)
- A strongly convergent Krasnosel'skiǐ-Mann-type algorithm for finding a common fixed point of a countably infinite family of nonexpansive operators in Hilbert spaces (Q2029653) (← links)
- Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids (Q2057230) (← links)
- Estimation of the modulus of Hölder metric regularity (Q2080920) (← links)
- Convergence rates of first- and higher-order dynamics for solving linear ill-posed problems (Q2088139) (← links)
- The Hopf-Lax formula for multiobjective costs with non-constant discount via set optimization (Q2102111) (← links)
- On vector quasi-equilibrium problems via a Browder-type fixed-point theorem (Q2107126) (← links)
- A fast continuous time approach with time scaling for nonsmooth convex optimization (Q2110501) (← links)
- The forward-backward-forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces (Q2189915) (← links)
- Variable smoothing for convex optimization problems using stochastic gradients (Q2211742) (← links)
- Fixing and extending some recent results on the ADMM algorithm (Q2225529) (← links)
- Tikhonov regularization of a second order dynamical system with Hessian driven damping (Q2230936) (← links)
- Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping (Q2232743) (← links)
- Convergence analysis for a primal-dual monotone + skew splitting algorithm with applications to total variation minimization (Q2251293) (← links)
- SDP relaxation algorithms for \(\mathbf{P(P}_0)\)-tensor detection (Q2307706) (← links)
- A Gauss-Seidel type inertial proximal alternating linearized minimization for a class of nonconvex optimization problems (Q2307755) (← links)
- The proximal alternating minimization algorithm for two-block separable convex optimization problems with linear constraints (Q2315259) (← links)
- Newton-like dynamics associated to nonconvex optimization problems (Q2319938) (← links)
- A general double-proximal gradient algorithm for d.c. programming (Q2330650) (← links)
- On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems (Q2340332) (← links)
- A variable smoothing algorithm for solving convex optimization problems (Q2343070) (← links)
- Convex risk minimization via proximal splitting methods (Q2355313) (← links)
- Fenchel-Lagrange duality versus geometric duality in convex optimization (Q2370031) (← links)
- Farkas-type results for fractional programming problems (Q2371162) (← links)
- A new condition for maximal monotonicity via representative functions (Q2372163) (← links)
- Convergence rates for forward-backward dynamical systems associated with strongly monotone inclusions (Q2408629) (← links)
- Differential stability of convex optimization problems with possibly empty solution sets (Q2420772) (← links)
- Employing different loss functions for the classification of images via supervised learning (Q2440581) (← links)
