Pages that link to "Item:Q1321192"

The following pages link to Proximal minimization algorithm with \(D\)-functions (Q1321192):

Displaying 50 items.

• Testing and non-linear preconditioning of the proximal point method (Q2198162) (← links)
• A characterization of proximity operators (Q2203356) (← links)
• Bregman Itoh-Abe methods for sparse optimisation (Q2203362) (← links)
• Generalized Bregman envelopes and proximity operators (Q2231335) (← links)
• Mass-spring-damper networks for distributed optimization in non-Euclidean spaces (Q2288705) (← 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 a Bregman regularized proximal point method for solving equilibrium problems (Q2311203) (← links)
• A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption (Q2322358) (← links)
• On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity (Q2322369) (← links)
• Lagrangian transformation and interior ellipsoid methods in convex optimization (Q2342139) (← links)
• Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs (Q2366829) (← links)
• A simple convergence analysis of Bregman proximal gradient algorithm (Q2419573) (← links)
• Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming (Q2420822) (← links)
• A new generalized APPA for maximal monotone operators (Q2469710) (← links)
• On the existence and convergence of approximate solutions for equilibrium problems in Banach spaces (Q2471908) (← links)
• Double-regularization proximal methods, with complementarity applications (Q2506183) (← links)
• Approximating zeros of monotone operators by proximal point algorithms (Q2655341) (← links)
• An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems (Q2701420) (← links)
• INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES (Q2769521) (← links)
• A proximal point algorithm with a ϕ-divergence for quasiconvex programming (Q2786322) (← links)
• EM Algorithms (Q2789805) (← links)
• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
• Interior proximal methods for equilibrium programming: part I (Q2868931) (← links)
• Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
• The Legendre Transformation in Modern Optimization (Q2957720) (← links)
• Generalized proximal point algorithms for multiobjective optimization problems (Q3006689) (← links)
• Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming (Q3066922) (← links)
• Proximal Methods with Penalization Effects in Banach Spaces (Q3157819) (← links)
• Rescaled proximal methods for linearly constrained convex problems (Q3515390) (← links)
• Block‐iterative algorithms (Q3563613) (← links)
• Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces (Q3577998) (← 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)
• Newton-type Methods with Generalized Distances For Constrained Optimization (Q4361042) (← links)
• On a proximal point method for convex optimization in banach spaces (Q4385279) (← links)
• An Extension of the Auxiliary Problem Principle to Nonsymmetric Auxiliary Operators (Q4386660) (← links)
• Strict convex regularizations, proximal points and augmented lagrangians (Q4528235) (← links)
• Regularizing with Bregman--Moreau Envelopes (Q4561226) (← links)
• First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems (Q4577742) (← links)
• Non-Convex feasibility problems and proximal point methods (Q4673320) (← links)
• Image Labeling Based on Graphical Models Using Wasserstein Messages and Geometric Assignment (Q4689763) (← links)
• A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗ (Q4819970) (← links)
• Interval underrelaxed bregman's method with an application (Q4859833) (← 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)
• The proximal point method with a vectorial Bregman regularization in multiobjective DC programming (Q5034939) (← links)
• Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
• The Bregman Proximal Average (Q5081784) (← links)