Pages that link to "Item:Q703163"
From MaRDI portal
The following pages link to Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. (Q703163):
Displaying 20 items.
- A proximal method with logarithmic barrier for nonlinear complementarity problems (Q280087) (← links)
- An inexact proximal method for quasiconvex minimization (Q319853) (← links)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds (Q441196) (← links)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- A numerical study of basins of attraction of zero-finding neural nets designed using control theory (Q691293) (← links)
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features (Q959923) (← links)
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case (Q959938) (← links)
- A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant (Q1037657) (← links)
- Asymptotic convergence of an inertial proximal method for unconstrained quasiconvex minimization (Q1041440) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- Identification of flexural rigidity in a Kirchhoff plates model using a convex objective and continuous Newton method (Q1665252) (← links)
- An optimization framework of biological dynamical systems (Q1794898) (← links)
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
- Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds (Q2911444) (← links)
- Singular Riemannian barrier methods and gradient-projection dynamical systems for constrained optimization (Q4669783) (← links)
- Hessian Barrier Algorithms for Linearly Constrained Optimization Problems (Q5233100) (← links)
- No-regret algorithms in on-line learning, games and convex optimization (Q6120936) (← links)
- Continuous time learning algorithms in optimization and game theory (Q6159505) (← links)
- First-order methods for convex optimization (Q6169988) (← links)