A Gauss-Newton method for convex composite optimization
From MaRDI portal
Publication:1914073
Recommendations
- On convergence of the Gauss-Newton method for convex composite optimization.
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Convergence of Gauss-Newton method for convex composite optimization. II: Applications
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
Cites work
- A global quadratic algorithm for solving a system of mixed equalities and inequalities
- A method for the solution of certain non-linear problems in least squares
- A Newton-Raphson method for the solution of systems of equations
- A Unified Analysis of Hoffman’s Bound via Fenchel Duality
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- An Embedding Theorem for Spaces of Convex Sets
- An Exact Penalization Viewpoint of Constrained Optimization
- Convex Analysis
- Descent methods for composite nondifferentiable optimization problems
- Extension of Newton's method to nonlinear functions with values in a cone
- First- and Second-Order Epi-Differentiability in Nonlinear Programming
- Generalized inverse methods for the best least squares solution of systems of non-linear equations
- scientific article; zbMATH DE number 3868525 (Why is no real title available?)
- scientific article; zbMATH DE number 4164577 (Why is no real title available?)
- scientific article; zbMATH DE number 4059113 (Why is no real title available?)
- scientific article; zbMATH DE number 3718471 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Least-norm linear programming solution as an unconstrained minimization problem
- Local properties of algorithms for minimizing nonsmooth composite functions
- Normal solutions of linear programs
- Normed Convex Processes
- Optimality conditions for non-finite valued convex composite functions
- Regularity and Stability for Convex Multivalued Functions
- Stability and regular points of inequality systems
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- Strong uniqueness in sequential linear programming
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- The Convergence of the Ben-Israel Iteration for Nonlinear Least Squares Problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Weak Sharp Minima in Mathematical Programming
Cited in
(75)- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
- Gauss-Newton methods for the complementarity problem
- Uniform convergence of higher order quasi Hermite-Fejér interpolation
- Local and global behavior for algorithms of solving equations
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
- Generalized Kalman smoothing: modeling and algorithms
- The value function approach to convergence analysis in composite optimization
- Characterizations of asymptotic cone of the solution set of a composite convex optimization problem
- Convergence analysis of a proximal Gauss-Newton method
- Generalized weak sharp minima in cone-constrained convex optimization with applications
- Asymptotic analysis in convex composite multiobjective optimization problems
- Modified inexact Levenberg-Marquardt methods for solving nonlinear least squares problems
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization
- The multiproximal linearization method for convex composite problems
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty
- Efficiency of minimizing compositions of convex functions and smooth maps
- Two-square theorems for infinite matrices on certain fields
- Empirical risk minimization: probabilistic complexity and stepsize strategy
- Robust low transformed multi-rank tensor methods for image alignment
- A dynamical system method for solving the split convex feasibility problem
- The equivalence of three types of error bounds for weakly and approximately convex functions
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- Newton's method for convex optimization
- On iterative computation of fixed points and optimization
- An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
- Extending the applicability of Gauss-Newton method for convex composite optimization on Riemannian manifolds
- Weak sharp efficiency in multiobjective optimization
- Extending the applicability of the Gauss-Newton method for convex composite optimization using restricted convergence domains and average Lipschitz conditions
- Strong metric (sub)regularity of Karush-Kuhn-Tucker mappings for piecewise linear-quadratic convex-composite optimization and the quadratic convergence of Newton's method
- Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
- Composite proximal bundle method
- Convergence analysis of the Gauss-Newton-type method for Lipschitz-like mappings
- Local properties of algorithms for minimizing nonsmooth composite functions
- scientific article; zbMATH DE number 1950396 (Why is no real title available?)
- Gauss-Newton method for convex composite optimizations on Riemannian manifolds
- Weak Sharp Minima for Convex Infinite Optimization Problems in Normed Linear Spaces
- Expanding the applicability of the Gauss-Newton method for convex optimization under a majorant condition
- Local convergence analysis of inexact Gauss-Newton method for singular systems of equations under majorant and center-majorant condition
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- A study of convex convex-composite functions via infimal convolution with applications
- On applications of the calmness moduli for multifunctions to error bounds
- Convergence analysis of new inertial method for the split common null point problem
- Relax-and-split method for nonconvex inverse problems
- Relaxed Gauss-Newton methods with applications to electrical impedance tomography
- A new trust-region method for solving systems of equalities and inequalities
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Proximally guided stochastic subgradient method for nonsmooth, nonconvex problems
- Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity
- Convergence of Gauss-Newton method for convex composite optimization. II: Applications
- High-order optimization methods for fully composite problems
- On convergence of the Gauss-Newton method for convex composite optimization.
- Survey of sequential convex programming and generalized Gauss-Newton methods
- Linearly-convergent FISTA variant for composite optimization with duality
- A fast method for obtaining convex combination coefficients
- Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints
- Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces
- Riemannian linearized proximal algorithms for nonnegative inverse eigenvalue problem
- Faster first-order primal-dual methods for linear programming using restarts and sharpness
- Consistent approximations in composite optimization
- Complete characterizations of local weak sharp minima with applications to semi-infinite optimization and complementarity
- A Levenberg-Marquardt method for nonsmooth regularized least squares
- Convergence analysis of the Gauss-Newton method for convex inclusion and convex-composite optimization problems
- Convergence of linearized proximal algorithms with adaptive stepsizes for convex composite optimization
- Accelerated-gradient-based generalized Levenberg-Marquardt method with oracle complexity bound and local quadratic convergence
- On second-order weak sharp minima of general nonconvex set-constrained optimization problems
- An efficient active-set method with applications to sparse approximations and risk minimization
- Variational analysis of a nonconvex and nonsmooth optimization problem: an introduction
- A proximal-type method for nonsmooth and nonconvex constrained minimization problems
- Data-driven tensor dictionary learning for image alignment
- Some unified theory for variance reduced prox-linear methods
- Sharp minima for multiobjective optimization in Banach spaces
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions
This page was built for publication: A Gauss-Newton method for convex composite optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914073)
