:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	de Oliveira, Welington, Sessa, Valentina, Sossa, David
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 52A40, 90C26, 90C46, 90C47, 49M37
Acceso en línea:	https://arxiv.org/abs/2511.10483
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Optimality conditions via exact penalty functions
por: Ivanov, Vsevolod Ivanov
Publicado: (2026)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
por: Van Tuyen, Nguyen, et al.
Publicado: (2024)

On the geometry of circumcentric directions of cones
por: Bello-Cruz, Yunier
Publicado: (2026)

A third order dynamical system for generalized monotone equation
por: Hai, Pham Viet, et al.
Publicado: (2024)

Exploiting cone approximations in an augmented Lagrangian method for conic optimization
por: Fukuda, Mituhiro, et al.
Publicado: (2024)

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints
por: Quan, Vu Hong, et al.
Publicado: (2025)

Strong Variational Sufficiency for Nonlinear Semidefinite Programming and its Implications
por: Wang, Shiwei, et al.
Publicado: (2022)

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

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
por: Kim, Jihun
Publicado: (2025)

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

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

Finding directional stationary points of DC programs
por: Thi, Hoai An Le, et al.
Publicado: (2026)

Augmented Lagrangian methods for fully convex composite optimization
por: De Marchi, Alberto, et al.
Publicado: (2025)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
por: Bodard, Alexander, et al.
Publicado: (2026)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
por: Tauheed, et al.
Publicado: (2026)

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

Optimality conditions at infinity for nonsmooth minimax programming
por: Van Tuyen, Nguyen, et al.
Publicado: (2024)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
por: Latafat, Puya, et al.
Publicado: (2021)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
por: Themelis, Andreas, et al.
Publicado: (2020)

On the existence and the stability of solutions in nonconvex vector optimization
por: Van Nghi, Tran, et al.
Publicado: (2025)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
por: Ahookhosh, Masoud, et al.
Publicado: (2019)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
por: Rahimi, Morteza, et al.
Publicado: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
por: Ghaderi, Susan, et al.
Publicado: (2025)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
por: Latafat, Puya, et al.
Publicado: (2019)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
por: Kabgani, Alireza, et al.
Publicado: (2025)

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

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

Optimization over convex polyhedra via Hadamard parametrizations
por: Tang, Tianyun, et al.
Publicado: (2024)

Clarke's tangent cones, subgradients, optimality conditions and the Lipschitzness at infinity
por: Nguyen, Minh Tung, et al.
Publicado: (2022)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
por: Jin, Ruinan, et al.
Publicado: (2026)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
por: García-Castaño, Fernando, et al.
Publicado: (2024)

Level Constrained First Order Methods for Function Constrained Optimization
por: Boob, Digvijay, et al.
Publicado: (2022)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
por: Ang, Andersen, et al.
Publicado: (2023)

Application and issues in abstract convexity
por: Millán, Reinier Díaz, et al.
Publicado: (2022)

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

Hidden convexity of quadratic systems and its application to quadratic programming
por: Huy, Nguyen Quang, et al.
Publicado: (2026)

Geometric characterizations of Lipschitz stability for convex optimization problems
por: Nghia, Tran T. A.
Publicado: (2024)

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
por: Lara, Felipe, et al.
Publicado: (2024)

Converting exhausters and coexhausters
por: Abbasov, Majid E.
Publicado: (2021)

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