Image de couverture de livre

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Lourenço, Bruno F., Fukuda, Ellen H., Fukushima, Masao
Format:	Preprint
Publié:	2017
Sujets:	Optimization and Control 90C46, 90C30
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A second-order sequential optimality condition for nonlinear second-order cone programming problems
par: Fukuda, Ellen H., et autres
Publié: (2023)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
par: Li, Huimin, et autres
Publié: (2025)

Exploiting cone approximations in an augmented Lagrangian method for conic optimization
par: Fukuda, Mituhiro, et autres
Publié: (2024)

A high-order augmented Lagrangian method with arbitrarily fast convergence
par: Lee, Young-Ju, et autres
Publié: (2026)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
par: Tang, Tianyun, et autres
Publié: (2026)

Optimization over convex polyhedra via Hadamard parametrizations
par: Tang, Tianyun, et autres
Publié: (2024)

Duality-based single-level reformulations of bilevel optimization problems
par: Dempe, Stephan, et autres
Publié: (2024)

Exact augmented Lagrangian duality for mixed integer convex optimization
par: Bhardwaj, Avinash, et autres
Publié: (2022)

An uncertainty model for positive-valued parameters with application to robust optimization
par: Tanaka, Tatsuya, et autres
Publié: (2026)

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
par: Nolasco, Eduardo, et autres
Publié: (2025)

On Constraint Qualifications for MPECs with Applications to Bilevel Hyperparameter Optimization for Machine Learning
par: Li, Jiani, et autres
Publié: (2025)

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
par: Mazanti, Guilherme, et autres
Publié: (2024)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
par: Sakabe, Keiya
Publié: (2026)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
par: Giang-Tran, Khanh-Hung, et autres
Publié: (2025)

Second-Order Necessary Conditions, Constraint Qualifications and Exact Penalty for Mathematical Programs with Switching Constraints
par: Chen, Jiawei, et autres
Publié: (2024)

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
par: Lahiri, Somdeb
Publié: (2024)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
par: Hou, Di, et autres
Publié: (2025)

Augmented Lagrangian methods for fully convex composite optimization
par: De Marchi, Alberto, et autres
Publié: (2025)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
par: McRae, Andrew D., et autres
Publié: (2023)

Hidden convexity of quadratic systems and its application to quadratic programming
par: Huy, Nguyen Quang, et autres
Publié: (2026)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
par: Fersztand, David, et autres
Publié: (2024)

A minimal face constant rank constraint qualification for reducible conic programming
par: Andreani, Roberto, et autres
Publié: (2023)

Approximate stationarity in disjunctive optimization: concepts, qualification conditions, and application to MPCCs
par: Käming, Isabella, et autres
Publié: (2025)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
par: Kanzow, Christian, et autres
Publié: (2025)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
par: De Marchi, Alberto
Publié: (2024)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
par: Käming, Isabella, et autres
Publié: (2024)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
par: Deng, Kangkang, et autres
Publié: (2024)

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
par: An, Duong Thi Viet, et autres
Publié: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
par: Quintero, Rodolfo A., et autres
Publié: (2024)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
par: Zhou, Bin, et autres
Publié: (2025)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
par: García-Castaño, Fernando, et autres
Publié: (2024)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
par: Rando, Marco, et autres
Publié: (2026)

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
par: Tauheed, et autres
Publié: (2026)

Closing the duality gap of the generalized trace ratio problem
par: Yang, Meijia, et autres
Publié: (2024)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
par: Lara, Felipe, et autres
Publié: (2025)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
par: Lapucci, Matteo, et autres
Publié: (2023)

Clarke's tangent cones, subgradients, optimality conditions and the Lipschitzness at infinity
par: Nguyen, Minh Tung, et autres
Publié: (2022)

A linesearch-based derivative-free method for noisy black-box problems
par: De Santis, Alberto, et autres
Publié: (2025)

A first-order augmented Lagrangian method for constrained minimax optimization
par: Lu, Zhaosong, et autres
Publié: (2023)

Approximate directional stationarity and associated qualification conditions
par: Käming, Isabella, et autres
Publié: (2026)