Pages that link to "Item:Q1914073"

The following pages link to A Gauss-Newton method for convex composite optimization (Q1914073):

Displaying 49 items.

• On iterative computation of fixed points and optimization (Q287945) (← links)
• Extending the applicability of Gauss-Newton method for convex composite optimization on Riemannian manifolds (Q298628) (← links)
• Weak sharp efficiency in multiobjective optimization (Q315498) (← links)
• Extending the applicability of the Gauss-Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions (Q333517) (← links)
• Composite proximal bundle method (Q359623) (← links)
• Convergence analysis of the Gauss-Newton-type method for Lipschitz-like mappings (Q368607) (← links)
• Gauss-Newton method for convex composite optimizations on Riemannian manifolds (Q452337) (← links)
• Expanding the applicability of the Gauss-Newton method for convex optimization under a majorant condition (Q489972) (← links)
• Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition (Q497466) (← links)
• A new trust-region method for solving systems of equalities and inequalities (Q520331) (← links)
• Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints (Q613599) (← links)
• Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity (Q654111) (← links)
• Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems (Q663722) (← links)
• Sharp minima for multiobjective optimization in Banach spaces (Q858169) (← links)
• Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions (Q959926) (← links)
• Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities (Q1012237) (← links)
• Uniform convergence of higher order quasi Hermite-Fejér interpolation (Q1334101) (← links)
• Local and global behavior for algorithms of solving equations (Q1428833) (← links)
• New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
• Generalized Kalman smoothing: modeling and algorithms (Q1678609) (← links)
• The value function approach to convergence analysis in composite optimization (Q1709968) (← links)
• Characterizations of asymptotic cone of the solution set of a composite convex optimization problem (Q1760780) (← links)
• Convergence analysis of a proximal Gauss-Newton method (Q1928745) (← links)
• Generalized weak sharp minima in cone-constrained convex optimization with applications (Q1935574) (← links)
• Asymptotic analysis in convex composite multiobjective optimization problems (Q1945516) (← links)
• Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems (Q2007835) (← links)
• Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence (Q2067681) (← links)
• Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization (Q2089785) (← links)
• The multiproximal linearization method for convex composite problems (Q2191762) (← links)
• Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
• Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
• Efficiency of minimizing compositions of convex functions and smooth maps (Q2330660) (← links)
• Two-square theorems for infinite matrices on certain fields (Q2367867) (← links)
• Empirical risk minimization: probabilistic complexity and stepsize strategy (Q2419551) (← links)
• Robust low transformed multi-rank tensor methods for image alignment (Q2660687) (← links)
• A dynamical system method for solving the split convex feasibility problem (Q2666702) (← links)
• The equivalence of three types of error bounds for weakly and approximately convex functions (Q2671442) (← links)
• Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
• On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications (Q2810547) (← links)
• An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
• Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
• A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications (Q5026439) (← links)
• Relax-and-split method for nonconvex inverse problems (Q5123708) (← links)
• Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (Q5219676) (← links)
• Linearly-convergent FISTA variant for composite optimization with duality (Q6101606) (← links)
• Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces (Q6140912) (← links)
• Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem (Q6141535) (← links)
• Faster first-order primal-dual methods for linear programming using restarts and sharpness (Q6165583) (← links)
• Consistent approximations in composite optimization (Q6165588) (← links)