Pages that link to "Item:Q870763"

The following pages link to Fast Moreau envelope computation I: Numerical algorithms (Q870763):

Displaying 15 items.

• Computing the conjugate of convex piecewise linear-quadratic bivariate functions (Q353145) (← links)
• Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis (Q618886) (← links)
• Convexity of the proximal average (Q630022) (← links)
• The piecewise linear-quadratic model for computational convex analysis (Q842774) (← links)
• Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
• A linear-time algorithm to compute the conjugate of convex piecewise linear-quadratic bivariate functions (Q1639725) (← links)
• Conditions for the existence, identification and calculus rules of the threshold of prox-boundedness (Q1996734) (← links)
• Compensated convexity on bounded domains, mixed Moreau envelopes and computational methods (Q2243417) (← links)
• Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time (Q2328199) (← links)
• A successive difference-of-convex approximation method for a class of nonconvex nonsmooth optimization problems (Q2425176) (← links)
• Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions (Q2450909) (← links)
• Duality and Convex Programming (Q2789804) (← links)
• Graph-Matrix Calculus for Computational Convex Analysis (Q2897284) (← links)
• Explicit formulas for 𝐶^{1,1} Glaeser-Whitney extensions of 1-Taylor fields in Hilbert spaces (Q3177856) (← links)
• A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions (Q6188504) (← links)