Pages that link to "Item:Q2576737"

The following pages link to A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737):

Displaying 50 items.

• A proximal method for composite minimization (Q304260) (← links)
• Composite proximal bundle method (Q359623) (← links)
• A decomposition algorithm for convex nondifferentiable minimization with errors (Q410890) (← links)
• The space decomposition theory for a class of eigenvalue optimizations (Q457214) (← links)
• Method of conjugate subgradients with constrained memory (Q463369) (← links)
• Optimality, identifiability, and sensitivity (Q463741) (← links)
• Synthesis of cutting and separating planes in a nonsmooth optimization method (Q747314) (← links)
• Nonsmoothness in machine learning: specific structure, proximal identification, and applications (Q829492) (← links)
• Fast Moreau envelope computation I: Numerical algorithms (Q870763) (← links)
• A superlinear space decomposition algorithm for constrained nonsmooth convex program (Q964944) (← links)
• An approximate decomposition algorithm for convex minimization (Q966076) (← links)
• Incremental-like bundle methods with application to energy planning (Q975362) (← links)
• On the local convergence analysis of the gradient sampling method for finite max-functions (Q1682976) (← links)
• A conceptual conjugate epi-projection algorithm of convex optimization: superlinear, quadratic and finite convergence (Q1733318) (← links)
• A fast gradient and function sampling method for finite-max functions (Q1756577) (← links)
• An effective nonsmooth optimization algorithm for locally Lipschitz functions (Q1934631) (← links)
• Characterizations and applications of generalized invexity and monotonicity in Asplund spaces (Q1939091) (← links)
• A decomposition method with redistributed subroutine for constrained nonconvex optimization (Q1949452) (← links)
• A conjugate gradient sampling method for nonsmooth optimization (Q2174178) (← links)
• The space decomposition method for the sum of nonlinear convex maximum eigenvalues and its applications (Q2190318) (← links)
• The \(\mathcal{U}\)-Lagrangian, fast track, and partial smoothness of a prox-regular function (Q2190753) (← links)
• \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications (Q2240656) (← links)
• Derivative-free optimization via proximal point methods (Q2250069) (← links)
• The \(\mathcal{VU}\)-decomposition to the proper convex function (Q2379901) (← links)
• A \(\mathcal{UV}\)-method for a class of constrained minimized problems of maximum eigenvalue functions (Q2397004) (← links)
• A space decomposition scheme for maximum eigenvalue functions and its applications (Q2407989) (← links)
• Computing proximal points of convex functions with inexact subgradients (Q2413568) (← links)
• On partial smoothness, tilt stability and the \({\mathcal {VU}}\)-decomposition (Q2414903) (← links)
• Functions and sets of smooth substructure: relationships and examples (Q2506176) (← links)
• Newton methods for nonsmooth convex minimization: connections among \(\mathcal U\)-Lagrangian, Riemannian Newton and SQP methods (Q2576738) (← links)
• Generic Minimizing Behavior in Semialgebraic Optimization (Q2789611) (← links)
• A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations (Q3188440) (← links)
• Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems (Q3426228) (← links)
• Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization (Q4620420) (← links)
• Derivative-free optimization methods for finite minimax problems (Q4924116) (← links)
• Active‐Set Newton Methods and Partial Smoothness (Q5000651) (← links)
• On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
• Partial Smoothness and Constant Rank (Q5067431) (← links)
• The chain rule for VU-decompositions of nonsmooth functions (Q5110185) (← links)
• A derivative-free 𝒱𝒰-algorithm for convex finite-max problems (Q5113714) (← links)
• Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization (Q5883313) (← links)
• Essentials of numerical nonsmooth optimization (Q5918756) (← links)
• Essentials of numerical nonsmooth optimization (Q5970841) (← links)
• Newton acceleration on manifolds identified by proximal gradient methods (Q6044974) (← links)
• Harnessing Structure in Composite Nonsmooth Minimization (Q6046827) (← links)
• Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)
• Accelerating inexact successive quadratic approximation for regularized optimization through manifold identification (Q6165598) (← links)
• Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming (Q6188510) (← links)
• Linear convergence of the derivative-free proximal bundle method on convex nonsmooth functions, with application to the derivative-free \(\mathcal{VU}\)-algorithm (Q6564758) (← links)
• Asymptotic normality and optimality in nonsmooth stochastic approximation (Q6621533) (← links)