Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems

DOI10.1016/j.cam.2023.115638OpenAlexW4388037215MaRDI QIDQ6126066

L. D. Secchin, P. C. jun. da Silva, Orizon P. Ferreira, Gilson N. Silva

Publication date: 9 April 2024

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2023.115638

zbMATH Keywords

Lipschitz continuitylocal convergenceconditional gradient methodsecant-type methodconstrained generalized equationsmetric regularity property

Mathematics Subject Classification ID

Nonlinear programming (90C30) Newton-type methods (49M15) Numerical methods for variational inequalities and related problems (65K15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Newton's method for solving generalized equations: Kantorovich's and Smale's approaches
• Convergence of inexact Newton methods for generalized equations
• Convergence analysis of the Gauss-Newton-type method for Lipschitz-like mappings
• Common solutions to variational inequalities
• A robust semi-local convergence analysis of Newton's method for cone inclusion problems in Banach spaces under affine invariant majorant condition
• A relaxed projection method for split variational inequalities
• Conditional gradient algorithms for norm-regularized smooth convex optimization
• Split monotone variational inclusions
• A matrix-free quasi-Newton method for solving large-scale nonlinear systems
• Algorithms for the split variational inequality problem
• A Newton conditional gradient method for constrained nonlinear systems
• A semilocal convergence of a secant-type method for solving generalized equations
• Inexact Josephy-Newton framework for generalized equations and its applications to local analysis of Newtonian methods for constrained optimization
• Newton's method for nonlinear inequalities
• Conditional gradient algorithms with open loop step size rules
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• Local convergence of some iterative methods for generalized equations.
• An inexact Newton-like conditional gradient method for constrained nonlinear systems
• Local convergence analysis of Newton's method for solving strongly regular generalized equations
• Newton's method with feasible inexact projections for solving constrained generalized equations
• Iterative methods for solving proximal split minimization problems
• Quasi-Newton methods for constrained nonlinear systems: complexity analysis and applications
• Semilocal convergence of the secant method under mild convergence conditions of differentiability
• On existence of solutions of parametrized generalized equations
• Damped Newton's method on Riemannian manifolds
• Approximations and generalized Newton methods
• Local convergence of quasi-Newton methods under metric regularity
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Extension of Newton's method to nonlinear functions with values in a cone
• An efficient damped Newton-type algorithm with globalization strategy on Riemannian manifolds
• Conditional Gradient Sliding for Convex Optimization
• Metric Regularity of Newton's Iteration
• Convergence analysis of a method for variational inclusions
• On the convergence of some methods for variational inclusions
• Strongly Regular Generalized Equations
• Convergence Rates for Conditional Gradient Sequences Generated by Implicit Step Length Rules
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• Rates of Convergence for Conditional Gradient Algorithms Near Singular and Nonsingular Extremals
• Generalized equations and their solutions, Part I: Basic theory
• Engineering and Economic Applications of Complementarity Problems
• Conditional Gradient Algorithmsfor Rank-One Matrix Approximations with a Sparsity Constraint
• Normed Convex Processes
• Kantorovich's Theorem on Newton's Method for Solving Strongly Regular Generalized Equation
• A projected derivative-free algorithm for nonlinear equations with convex constraints
• Subspace Trust‐Region Methods for Large Bound‐Constrained Nonlinear Equations
• Convergence of quasi-Newton methods for solving constrained generalized equations

This page was built for publication: Secant-inexact projection algorithms for solving a new class of constrained mixed generalized equations problems