Cover Image

A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ruszczyński, Andrzej, Yang, Shangzhe
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Machine Learning 90C15, 49J52, 60-08
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Convergence Rate of a Functional Learning Method for Contextual Stochastic Optimization
by: Smith, Noel, et al.
Published: (2026)

AN-SPS: Adaptive Sample Size Nonmonotone Line Search Spectral Projected Subgradient Method for Convex Constrained Optimization Problems
by: Jerinkić, Nataša Krklec, et al.
Published: (2022)

From Nonsmooth Minima to Smooth Branches via Heat Kernel Regularization
by: Jo, Hyeontae
Published: (2026)

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

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

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

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

Asymptotic Consistency for Nonconvex Risk-Averse Stochastic Optimization with Infinite Dimensional Decision Spaces
by: Milz, Johannes, et al.
Published: (2022)

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

A Near-Optimal Total Complexity for the Inexact Accelerated Proximal Gradient Method via Quadratic Growth
by: Li, Hongda, et al.
Published: (2026)

Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity
by: Evens, Brecht, et al.
Published: (2025)

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

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

The Least Singular Value Function in Variational Analysis
by: Jelitte, Mario, et al.
Published: (2025)

A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
by: Qiu, Junwen, et al.
Published: (2023)

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

$\ell_0$-Norm Multiobjective Optimization Models Motivated by Applications to Proton Therapy
by: Cong, Xiaoda, et al.
Published: (2025)

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)

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

Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model
by: Tao, Ting, et al.
Published: (2024)

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

A Descent Method for Nonsmooth Multiobjective Optimization in Hilbert Spaces
by: Sonntag, Konstantin, et al.
Published: (2024)

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

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
by: Hermans, Ben, et al.
Published: (2020)

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

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

Optimal Control of Nonconvex Sweeping Processes with Variable Time via Finite-Difference Approximations
by: Cao, Tan H., et al.
Published: (2025)

Convergence of the Chambolle-Pock Algorithm in the Absence of Monotonicity
by: Evens, Brecht, et al.
Published: (2023)

Alternating Iteratively Reweighted $\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization
by: Wang, Hao, et al.
Published: (2024)

Quadratic optimal transportation problem with a positive semi definite structure on the cost function
by: Jeong, Seonghyeon
Published: (2024)

A note on the convergence of deterministic gradient sampling in nonsmooth optimization
by: Gebken, Bennet
Published: (2023)

Metric Entropy-Free Sample Complexity Bounds for Sample Average Approximation in Convex Stochastic Programming
by: Liu, Hongcheng, et al.
Published: (2024)

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

A note on the uniformity of strong subregularity around the reference point
by: Roubal, Tomáš
Published: (2025)

A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness
by: Wang, Ziyuan, et al.
Published: (2022)

Directional Subdifferentials at Infinity and Its Applications
by: Kien, Le Ngoc, et al.
Published: (2025)

Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
by: Shikhman, Vladimir
Published: (2024)

Approximate directional stationarity and associated qualification conditions
by: Käming, Isabella, et al.
Published: (2026)