Pages that link to "Item:Q4022026"
From MaRDI portal
The following pages link to Entropic Proximal Mappings with Applications to Nonlinear Programming (Q4022026):
Displayed 37 items.
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← 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)
- The Legendre Transformation in Modern Optimization (Q2957720) (← 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)
- First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (Q4577742) (← links)
- Re-examination of Bregman functions and new properties of their divergences (Q4613995) (← links)
- Non-Convex feasibility problems and proximal point methods (Q4673320) (← links)
- Generalized Sinkhorn Iterations for Regularizing Inverse Problems Using Optimal Mass Transport (Q4689648) (← links)
- A proximity moving horizon estimator for a class of nonlinear systems (Q5000689) (← links)
- The indefinite proximal point algorithms for maximal monotone operators (Q5009166) (← links)
- Inexact High-Order Proximal-Point Methods with Auxiliary Search Procedure (Q5013580) (← links)
- Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
- Split equality common null point problem for Bregman quasi-nonexpansive mappings (Q5083148) (← links)
- On the linear convergence of a Bregman proximal point algorithm (Q5088831) (← links)
- Bregman Proximal Point Algorithm Revisited: A New Inexact Version and Its Inertial Variant (Q5093643) (← links)
- On EM algorithms and their proximal generalizations (Q5190287) (← links)
- On Barrier and Modified Barrier Multigrid Methods for Three-Dimensional Topology Optimization (Q5208730) (← links)
- Modern regularization methods for inverse problems (Q5230515) (← links)
- Weak and strong convergence of proximal penalization and proximal splitting algorithms for two-level hierarchical Ky Fan minimax inequalities (Q5248237) (← links)
- A class of nonlinear proximal point algorithms for variational inequality problems (Q5266138) (← links)
- An introduction to continuous optimization for imaging (Q5740077) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- Choose Your Path Wisely: Gradient Descent in a Bregman Distance Framework (Q5860343) (← links)
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm (Q6160427) (← links)
- Provable Phase Retrieval with Mirror Descent (Q6168333) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- Entropic Trust Region for Densest Crystallographic Symmetry Group Packings (Q6173479) (← links)