Cover Image

Sufficient Conditions for Error Distance Reduction in the (\ell^2)-norm Trust Region between Minimizers of Local Nonconvex Multivariate Quadratic Approximates

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Xie, Pengcheng
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 65G99, 65K05, 90C30
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

MATRO: Metric-Aware Trust-Region Optimization with Fully Quadratic Models
by: Hu, Wei, et al.
Published: (2026)

Adaptive Dimension Reduction for Overlapping Group Sparsity
by: Bai, Yifan, et al.
Published: (2026)

BUP-TR: Bayesian Underdetermined Projection Trust-Region Methods for Derivative-Free Optimization
by: Hu, Wei, et al.
Published: (2026)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
by: Xie, Xiyuan, et al.
Published: (2026)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

A Jacobi-type Newton method for Nash equilibrium problems with descent guarantees
by: Kolossoski, Oliver, et al.
Published: (2022)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
by: Xie, Xiyuan, et al.
Published: (2025)

Accuracy and Relationships of Quadratic Models in Derivative-free Optimization
by: Chen, Yiwen, et al.
Published: (2026)

An Additively Preconditioned Trust Region Strategy for Machine Learning
by: Alegría, Samuel Cruz, et al.
Published: (2025)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
by: Hu, Yaling, et al.
Published: (2026)

Convergence of iterates and improved rates for accelerated augmented Lagrangian methods for linearly constrained convex optimization
by: He, Xin, et al.
Published: (2026)

Riemannian Trust Region Methods for SC$^1$ Minimization
by: Zhang, Chenyu, et al.
Published: (2023)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
by: Xie, Lijun, et al.
Published: (2025)

Model-Driven Subspaces for Large-Scale Optimization with Local Approximation Strategy
by: He, Yitong, et al.
Published: (2025)

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection
by: Zeng, Hanfeng, et al.
Published: (2026)

Deep Centralization for the Circumcentered Reflection Method
by: Barros, Pablo
Published: (2025)

Nonsmooth Projection-Free Optimization with Functional Constraints
by: Asgari, Kamiar, et al.
Published: (2023)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2025)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
by: Xie, Pengcheng, et al.
Published: (2023)

New gradient methods with 3 dimensional quadratic termination
by: Xie, Yixin, et al.
Published: (2026)

Stochastic optimization over proximally smooth sets
by: Davis, Damek, et al.
Published: (2020)

The Augmented Lagrangian Methods: Overview and Recent Advances
by: Deng, Kangkang, et al.
Published: (2025)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
by: Zhu, Kehan, et al.
Published: (2026)

Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
by: Dolgopolik, M. V.
Published: (2018)

Improved Penalty Function Approaches for Optimization Problems with General Orthogonality
by: Zhang, Yongshen, et al.
Published: (2026)

Augmented Lagrangian Functions for Cone Constrained Optimization: the Existence of Global Saddle Points and Exact Penalty Property
by: Dolgopolik, M. V.
Published: (2017)

A descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds
by: Tang, Chunming, et al.
Published: (2023)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

Fast convex optimization via closed-loop time scaling of gradient dynamics
by: Attouch, Hedy, et al.
Published: (2023)

Privacy-Preserving Black-Box Optimization (PBBO): Theory and the Model-Based Algorithm DFOp
by: Xie, Pengcheng
Published: (2025)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

S2MPJ and CUTEst optimization problems for Matlab, Python and Julia
by: Gratton, Serge, et al.
Published: (2024)

Lipschitz continuity of solution multifunctions of extended $\ell_1$ regularization problems
by: Meng, Kaiwen, et al.
Published: (2024)

Objective Value Change and Shape-Based Accelerated Optimization for the Neural Network Approximation
by: Xie, Pengcheng, et al.
Published: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
by: Davis, Damek, et al.
Published: (2024)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Accelerating Diagonal Methods for Bilevel Optimization: Unified Convergence via Continuous-Time Dynamics
by: Boţ, Radu Ioan, et al.
Published: (2025)

Distributed Gradient-Regularized Newton Method: Scheduled Consensus and O(epsilon^{-1}) Global Iteration Complexity
by: Hu, Wei, et al.
Published: (2026)