Imagen de Portada

Exploiting cone approximations in an augmented Lagrangian method for conic optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fukuda, Mituhiro, Gómez, Walter, Haeser, Gabriel, Mito, Leonardo Makoto
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 90C30, 49M37, 90C26
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A minimal face constant rank constraint qualification for reducible conic programming
por: Andreani, Roberto, et al.
Publicado: (2023)

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization
por: He, Chuan, et al.
Publicado: (2023)

Switching Point Optimization for Abstract Parabolic Equations
por: Buchheim, Christoph, et al.
Publicado: (2026)

Variational Poisson Denoising via Augmented Lagrangian Methods
por: Kanzow, Christian, et al.
Publicado: (2023)

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

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

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
por: Lourenço, Bruno F., et al.
Publicado: (2017)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
por: Bai, Xiaoning, et al.
Publicado: (2024)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
por: Scheinberg, Katya, et al.
Publicado: (2023)

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

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

Flexible block-iterative analysis for the Frank-Wolfe algorithm
por: Braun, Gábor, et al.
Publicado: (2024)

Measuring dissimilarity between convex cones by means of max-min angles
por: de Oliveira, Welington, et al.
Publicado: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
por: Deng, Kangkang, et al.
Publicado: (2024)

Nonlinear constrained optimization of Schur test functions
por: Anikushin, Mikhail, et al.
Publicado: (2025)

Modified limited memory BFGS with displacement aggregation and its application to the largest eigenvalue problem
por: Sahu, Manish Kumar, et al.
Publicado: (2023)

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

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

A heavy-ball type curve search method for smooth convexly constrained optimization
por: Donnini, Federica, et al.
Publicado: (2026)

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

Low-rank Orthogonalization for Large-scale Matrix Optimization with Applications to Foundation Model Training
por: He, Chuan, et al.
Publicado: (2025)

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

An Inexact Proximal Linearized DC Algorithm with Provably Terminating Inner Loop
por: Zhang, Yi, et al.
Publicado: (2023)

Cubic Regularization Technique of the Newton Method for Vector Optimization
por: Ghosh, Debdas
Publicado: (2025)

A first-order augmented Lagrangian method for constrained minimax optimization
por: Lu, Zhaosong, et al.
Publicado: (2023)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
por: Gratton, Serge, et al.
Publicado: (2024)

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

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
por: Thieu, Nguyen Nang, et al.
Publicado: (2026)

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

Local properties and augmented Lagrangians in fully nonconvex composite optimization
por: De Marchi, Alberto, et al.
Publicado: (2023)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
por: Alcantara, Jan Harold, et al.
Publicado: (2024)

A multiscale Consensus-Based algorithm for multi-level optimization
por: Herty, Michael, et al.
Publicado: (2024)

A second-order sequential optimality condition for nonlinear second-order cone programming problems
por: Fukuda, Ellen H., et al.
Publicado: (2023)

Accelerated stochastic first-order method for convex optimization under heavy-tailed noise
por: He, Chuan, et al.
Publicado: (2025)

On the resolution of $\ell_1$-norm minimization via a two-metric adaptive projection method
por: Wu, Hanju, et al.
Publicado: (2025)

A stochastic first-order method with multi-extrapolated momentum for highly smooth unconstrained optimization
por: He, Chuan
Publicado: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
por: Jia, Xiaoxi, et al.
Publicado: (2025)

Enhancing sharp augmented Lagrangian methods with smoothing techniques for nonlinear programming
por: Romero, José Luis, et al.
Publicado: (2024)

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