AN-SPS: Adaptive Sample Size Nonmonotone Line Search Spectral Projected Subgradient Method for Convex Constrained Optimization Problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jerinkić, Nataša Krklec, Ostojić, Tijana
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control 90C15, 49J52
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
by: Krejić, Nataša, et al.
Published: (2025)

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

IPAS: An Adaptive Sample Size Method for Weighted Finite Sum Problems with Linear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
by: Li, Hanyang, et al.
Published: (2025)

Optimal Methods for Unknown Piecewise Smooth Problems I: Convex Optimization
by: Lin, Zhenwei, et al.
Published: (2026)

On the $p$-order Semismoothness of the Metric Projection onto Slices of the Positive Semidefinite Cone
by: Chen, Ruoning, et al.
Published: (2025)

Subgradient Methods on Manifolds with Lower Bounded Curvature
by: Bento, G. C., et al.
Published: (2026)

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
by: Mashkoorzadeh, Feryal, et al.
Published: (2026)

Regular Subgradients of Marginal Functions with Applications to Calculus and Bilevel Programming
by: Hai, Le Phuoc, et al.
Published: (2024)

Smoothness of Subgradient Mappings and Its Applications in Parametric Optimization
by: Hang, Nguyen T. V., et al.
Published: (2023)

Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
by: Chen, Liang, et al.
Published: (2024)

A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization
by: Ruszczyński, Andrzej, et al.
Published: (2024)

Isolated Calmness in Regularized Convex Optimization
by: Nghia, Tran T. A., et al.
Published: (2026)

ASMOP: Additional sampling stochastic trust region method for multi-objective problems
by: Jerinkić, Nataša Krklec, et al.
Published: (2025)

A Projected Variable Smoothing for Weakly Convex Optimization and Supremum Functions
by: López-Rivera, Sergio, et al.
Published: (2025)

SLiSeS: Subsampled Line Search Spectral Gradient Method for Finite Sums
by: Bellavia, Stefania, et al.
Published: (2023)

Second-Order Strong Optimality and Second-Order Duality for Nonsmooth Constrained Multiobjective Fractional Programming Problems
by: Chen, Jiawei, et al.
Published: (2024)

A non-monotone trust-region method with noisy oracles and additional sampling
by: Krejic, Natasa, et al.
Published: (2023)

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
by: Ma, Chiyu, et al.
Published: (2026)

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
by: Ahookhosh, Masoud, et al.
Published: (2026)

Sample Size Estimates for Risk-Neutral Semilinear PDE-Constrained Optimization
by: Milz, Johannes, et al.
Published: (2022)

Characterizations of Tilt-Stable Local Minimizers of a Class of Matrix Optimization Problems
by: Ding, Chao, et al.
Published: (2025)

Characterizations of Variational Convexity and Tilt Stability via Quadratic Bundles
by: Khanh, Pham Duy, et al.
Published: (2025)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

Error Bounds for a Class of Cone-Convex Inclusion Problems
by: Huy, Nguyen Quang, et al.
Published: (2025)

Set-valued evenly convex functions: characterizations and c-conjugacy
by: Fajardo, M. D.
Published: (2025)

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
by: Lahiri, Somdeb
Published: (2024)

Stable Recovery of Regularized Linear Inverse Problems
by: Nghia, Tran T. A., et al.
Published: (2024)

Nonmonotone subgradient methods based on a local descent lemma
by: Aragón-Artacho, Francisco J., et al.
Published: (2025)

Ball-proximal point method on a Hadamard Manifolds
by: Babu, F., et al.
Published: (2026)

A fresh look into variational analysis of $\mathcal C^2$-partly smooth functions
by: Hang, Nguyen T. V., et al.
Published: (2024)

A quadratically convergent proximal algorithm for nonnegative tensor decomposition
by: Vervliet, Nico, et al.
Published: (2020)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

On Zermelo's planar navigation problem for convex bodies, and implications for non-convex optimal routing
by: Della Rossa, Matteo, et al.
Published: (2025)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)

On Subdifferentials Via a Generalized Conjugation Scheme: An Application to DC Problems and Optimality Conditions
by: Fajardo, M. D., et al.
Published: (2025)

Optimality conditions in control problems with random state constraints in probabilistic or almost-sure form
by: Geiersbach, Caroline, et al.
Published: (2023)

Characterizations of Strong Variational Sufficiency in General Models of Composite Optimization
by: Mordukhovich, Boris S., et al.
Published: (2025)

Convergence Rates for the Alternating Minimization Algorithm in Structured Nonsmooth and Nonconvex Optimization
by: Bento, Glaydston C., et al.
Published: (2026)

A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions
by: Zhu, Daoli, et al.
Published: (2023)