Cover Image

Augmented Lagrangian methods for convex optimization with priority constraints via an infeasibility control framework

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Yamakawa, Yuya, Yamanaka, Shota, Yamashita, Nobuo
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convergence analysis of a regularized Newton method with generalized regularization terms for convex optimization problems
by: Yamakawa, Yuya, et al.
Published: (2024)

Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
by: Andrews, Roland, et al.
Published: (2025)

A strong second-order sequential optimality condition for nonlinear programming problems
by: Li, Huimin, et al.
Published: (2025)

Local convergence analysis of stabilized sequential quadratic programming methods for optimization problems in Banach spaces
by: Yamakawa, Yuya
Published: (2025)

Superlinear and quadratic convergence of a stabilized sequential quadratic semidefinite programming method for nonlinear semidefinite programming problems
by: Yamakawa, Yuya
Published: (2022)

A twice continuously differentiable penalty function for nonlinear semidefinite programming problems and its application
by: Yamakawa, Yuya
Published: (2025)

An uncertainty model for positive-valued parameters with application to robust optimization
by: Tanaka, Tatsuya, et al.
Published: (2026)

Modified Armijo line search in optimization on Riemannian submanifolds with reduced computational cost
by: Sato, Hiroyuki, et al.
Published: (2023)

An inexact infeasible arc-search interior-point method for linear optimization problems
by: Iida, Einosuke, et al.
Published: (2024)

An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
by: Kanzow, Christian, et al.
Published: (2025)

A feedback control approach to convex optimization with inequality constraints
by: Cerone, V., et al.
Published: (2024)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
by: Yang, Yaguang
Published: (2022)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Block Coordinate Descent Network Simplex Methods for Optimal Transport
by: Li, Lingrui, et al.
Published: (2025)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
by: Pinheiro, Maria Eduarda, et al.
Published: (2024)

A black-box optimization method with polynomial-based kernels and quadratic-optimization annealing
by: Minamoto, Yuki, et al.
Published: (2025)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

Regularity in shape optimization under convexity constraint
by: Lamboley, Jimmy, et al.
Published: (2022)

An accelerated proximal bundle method for convex optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

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

Augmented Lagrange method for optimal control problems of parabolic equation with state constraints
by: You, Weilong, et al.
Published: (2024)

Randomized gradient-free methods in convex optimization
by: Gasnikov, Alexander, et al.
Published: (2022)

Robustness certificates in data-driven non-convex optimization with additively-uncertain constraints
by: Gallo, Alexander J, et al.
Published: (2026)

A globalized inexact semismooth Newton method for strongly convex optimal control problems
by: Wachsmuth, Daniel
Published: (2025)

A unified framework for inexact adaptive stepsizes in the gradient methods, the conjugate gradient methods and the quasi-Newton methods for strictly convex quadratic optimization
by: Liu, Zexian
Published: (2026)

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2025)

Extended mean-field control under constraints: The generalized Fritz-John conditions and Lagrangian method
by: Bo, Lijun, et al.
Published: (2024)

A Lagrangian shape and topology optimization framework based on semi-discrete optimal transport
by: Dapogny, Charles, et al.
Published: (2024)

New merit functions for multiobjective optimization and their properties
by: Tanabe, Hiroki, et al.
Published: (2020)

Solving separable convex optimization problems: Faster prediction-correction framework
by: Zhang, Tao, et al.
Published: (2023)

Exploiting higher-order derivatives in convex optimization methods
by: Kamzolov, Dmitry, et al.
Published: (2022)

Universal subgradient and proximal bundle methods for convex and strongly convex hybrid composite optimization
by: Guigues, Vincent, et al.
Published: (2024)

First-order methods for stochastic and finite-sum convex optimization with deterministic constraints
by: Lu, Zhaosong, et al.
Published: (2025)

Online convex optimization for constrained control of nonlinear systems
by: Nonhoff, Marko, et al.
Published: (2024)

A unified optimal control framework: time-optimal control and stochastic optimal control
by: Yang, Shuzhen
Published: (2025)

Automated algorithm design for convex optimization problems with linear equality constraints
by: Ozaslan, Ibrahim K., et al.
Published: (2025)

Dynamic programming and dimensionality in convex stochastic optimization and control
by: Pennanen, Teemu, et al.
Published: (2025)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2023)

A preconditioned inexact infeasible quantum interior point method for linear optimization
by: Wu, Zeguan, et al.
Published: (2024)

Online convex optimization for robust control of constrained dynamical systems
by: Nonhoff, Marko, et al.
Published: (2024)