Pages that link to "Item:Q4022026"
From MaRDI portal
The following pages link to Entropic Proximal Mappings with Applications to Nonlinear Programming (Q4022026):
Displayed 50 items.
- On the ergodic convergence rates of a first-order primal-dual algorithm (Q312675) (← links)
- Moreau's decomposition in Banach spaces (Q353156) (← links)
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant (Q421699) (← links)
- Modified Lagrangian methods for separable optimization problems (Q437562) (← links)
- Convergence of a proximal point algorithm for solving minimization problems (Q442796) (← links)
- The CoMirror algorithm for solving nonsmooth constrained convex problems (Q614018) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- An interior proximal method in vector optimization (Q635150) (← links)
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization. (Q703163) (← links)
- Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach (Q779763) (← links)
- Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming (Q925232) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems (Q975360) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- Primal-dual proximal point algorithm for linearly constrained convex programming problems (Q1203067) (← links)
- Approximate iterations in Bregman-function-based proximal algorithms (Q1290655) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Nonlinear rescaling and proximal-like methods in convex optimization (Q1363410) (← links)
- Equilibrium programming using proximal-like algorithms (Q1373724) (← links)
- Subgradient method with entropic projections for convex nondifferentiable minimization (Q1384058) (← links)
- Approximation of linear programs by Bregman's \(D_F\) projections (Q1584816) (← links)
- A simplified view of first order methods for optimization (Q1650767) (← links)
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem (Q1734367) (← links)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← links)
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization (Q1783579) (← links)
- Mirror descent and nonlinear projected subgradient methods for convex optimization. (Q1811622) (← links)
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators (Q1873664) (← links)
- Epigraphical nesting: A unifying theory for the convergence of algorithms (Q1893312) (← links)
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems (Q1896575) (← links)
- On the twice differentiable cubic augmented Lagrangian (Q1908654) (← links)
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities (Q1924060) (← links)
- Alternating minimization as sequential unconstrained minimization: a survey (Q1949577) (← links)
- Large deformation frictional contact mechanics: Continuum formulation and augmented Lagrangian treatment (Q1972938) (← links)
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis (Q2010228) (← links)
- Point process estimation with Mirror Prox algorithms (Q2019904) (← links)
- Linearized Krylov subspace Bregman iteration with nonnegativity constraint (Q2035517) (← links)
- On the nonexpansive operators based on arbitrary metric: a degenerate analysis (Q2093074) (← links)
- Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
- The developments of proximal point algorithms (Q2158107) (← links)
- Bregman Itoh-Abe methods for sparse optimisation (Q2203362) (← links)
- Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity (Q2302825) (← links)
- A proximal point algorithm with asymmetric linear term (Q2311109) (← links)
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
- A new algorithm for finding fixed points of Bregman quasi-nonexpansive mappings and zeros of maximal monotone operators by using products of resolvents (Q2410856) (← links)
- A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
- Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
- Building initial partitions through sampling techniques (Q2643942) (← links)
- Bregman circumcenters: basic theory (Q2664902) (← links)
- Inexact accelerated high-order proximal-point methods (Q2689812) (← links)