Pages that link to "Item:Q4022026"
From MaRDI portal
The following pages link to Entropic Proximal Mappings with Applications to Nonlinear Programming (Q4022026):
Displayed 45 items.
- 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)
- 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)
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints (Q1762409) (← 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)
- Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
- Building initial partitions through sampling techniques (Q2643942) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
- Self-Dual Smooth Approximations of Convex Functions via the Proximal Average (Q2897273) (← links)
- Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) (← links)
- Rescaled proximal methods for linearly constrained convex problems (Q3515390) (← links)
- Block‐iterative algorithms (Q3563613) (← links)
- A new family of penalties for augmented Lagrangian methods (Q3588894) (← links)
- A characterization of the optimal set of linear programs based on the augmented lagrangian (Q4264505) (← links)
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization (Q4351184) (← links)
- Penalty/Barrier multiplier algorthm for semidefinit programming<sup>∗</sup> (Q4514285) (← links)
- Strict convex regularizations, proximal points and augmented lagrangians (Q4528235) (← links)
- Non-Convex feasibility problems and proximal point methods (Q4673320) (← links)
- On EM algorithms and their proximal generalizations (Q5190287) (← links)