Entropic Proximal Mappings with Applications to Nonlinear Programming
From MaRDI portal
Recommendations
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- The Moreau envelope function and proximal mapping with respect to the Bregman distances in Banach spaces
- Entropy-Like Proximal Methods in Convex Programming
- A proximal-like algorithm for a class of nonconvex programming
- Bregman-like functions and proximal methods for variational problems with nonlinear constraints
Cited in
(96)- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- Approximate iterations in Bregman-function-based proximal algorithms
- A multiprojection algorithm using Bregman projections in a product space
- Nonlinear rescaling and proximal-like methods in convex optimization
- Equilibrium programming using proximal-like algorithms
- Subgradient method with entropic projections for convex nondifferentiable minimization
- Approximation of linear programs by Bregman's \(D_F\) projections
- A simplified view of first order methods for optimization
- A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- A note on the existence of zeroes of convexly regularized sums of maximal monotone operators
- Epigraphical nesting: A unifying theory for the convergence of algorithms
- A globally convergent Newton method for convex \(SC^ 1\) minimization problems
- On the twice differentiable cubic augmented Lagrangian
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- Alternating minimization as sequential unconstrained minimization: a survey
- Large deformation frictional contact mechanics: Continuum formulation and augmented Lagrangian treatment
- Nonsymmetric proximal point algorithm with moving proximal centers for variational inequalities: convergence analysis
- Point process estimation with Mirror Prox algorithms
- Linearized Krylov subspace Bregman iteration with nonnegativity constraint
- On the nonexpansive operators based on arbitrary metric: a degenerate analysis
- Optimal complexity and certification of Bregman first-order methods
- The developments of proximal point algorithms
- Bregman Itoh-Abe methods for sparse optimisation
- Bregman proximal mappings and Bregman-Moreau envelopes under relative prox-regularity
- A proximal point algorithm with asymmetric linear term
- On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity
- A new algorithm for finding fixed points of Bregman quasi-nonexpansive mappings and zeros of maximal monotone operators by using products of resolvents
- A simple convergence analysis of Bregman proximal gradient algorithm
- Double-regularization proximal methods, with complementarity applications
- Building initial partitions through sampling techniques
- Bregman circumcenters: basic theory
- Inexact accelerated high-order proximal-point methods
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- Dykstras algorithm with bregman projections: A convergence proof
- A proximal point algorithm with a -divergence for quasiconvex programming
- Self-Dual Smooth Approximations of Convex Functions via the Proximal Average
- Decomposition methods based on augmented Lagrangians: a survey
- The Legendre transformation in modern optimization
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Rescaled proximal methods for linearly constrained convex problems
- Moreau's decomposition in Banach spaces
- Block-iterative algorithms
- A new family of penalties for augmented Lagrangian methods
- Forward mean proximal pairs and zero entropy
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- A characterization of the optimal set of linear programs based on the augmented lagrangian
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- Modified Lagrangian methods for separable optimization problems
- Convergence of a proximal point algorithm for solving minimization problems
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- Strict convex regularizations, proximal points and augmented lagrangians
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Re-examination of Bregman functions and new properties of their divergences
- Non-Convex feasibility problems and proximal point methods
- Generalized Sinkhorn iterations for regularizing inverse problems using optimal mass transport
- A proximity moving horizon estimator for a class of nonlinear systems
- The indefinite proximal point algorithms for maximal monotone operators
- Inexact high-order proximal-point methods with auxiliary search procedure
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- Split equality common null point problem for Bregman quasi-nonexpansive mappings
- On the linear convergence of a Bregman proximal point algorithm
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- On EM algorithms and their proximal generalizations
- On barrier and modified barrier multigrid methods for three-dimensional topology optimization
- Modern regularization methods for inverse problems
- Weak and strong convergence of proximal penalization and proximal splitting algorithms for two-level hierarchical Ky Fan minimax inequalities
- A class of nonlinear proximal point algorithms for variational inequality problems
- An introduction to continuous optimization for imaging
- A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
- Choose your path wisely: gradient descent in a Bregman distance framework
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
- Provable Phase Retrieval with Mirror Descent
- First-order methods for convex optimization
- Entropic Trust Region for Densest Crystallographic Symmetry Group Packings
- An interior proximal method in vector optimization
- The geometry of monotone operator splitting methods
- Bregman methods for large-scale optimization with applications in imaging
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods
- Proximal Galerkin: a structure-preserving finite element method for pointwise bound constraints
- Anisotropic proximal gradient
- A novel nonconvex penalty method for a rank constrained matrix optimization problem and its applications
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- The symmetry coefficient of positively homogeneous functions
- Inertial proximal difference-of-convex algorithm with convergent Bregman plug-and-play for nonconvex imaging
- Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach
- Fast Moreau envelope computation I: Numerical algorithms
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming
- Proximal methods for nonlinear programming: Double regularization and inexact subproblems
- Interior proximal methods and central paths for convex second-order cone programming
This page was built for publication: Entropic Proximal Mappings with Applications to Nonlinear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4022026)
