Identification of active component functions in finite-max minimisation via a smooth reformulation

DOI10.1007/S00245-025-10229-7MaRDI QIDQ6998538zbMATH OpenFDO

Authors C. J. Ras, Matthew K. Tam, Daniel J. Uteda

Publication date 11 April 2025

Published in Applied Mathematics and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00245-025-10229-7

zbMATH Keywords

active manifoldsfinite max functionsmin-max problemssupport identification

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Acceleration of convergence in numerical analysis (65B99) Numerical methods for variational inequalities and related problems (65K15) Complexity and performance of numerical algorithms (65Y20) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Minimax problems in mathematical programming (90C47)

Cites work

• A \(\mathcal{VU}\)-algorithm for convex minimization
• A derivative-free \(\mathcal{V} \mathcal{U}\)-algorithm for convex finite-max problems
• A necessary and sufficient regularity condition to have bounded multipliers in nonconvex programming
• Active Set Identification in Nonlinear Programming
• Algorithms with adaptive smoothing for finite minimax problems
• An Incremental Method for Solving Convex Finite Min-Max Problems
• An introduction to continuous optimization for imaging
• An Introduction to Variational Inequalities and Their Applications
• Convex analysis and monotone operator theory in Hilbert spaces
• Convex analysis and nonlinear optimization. Theory and examples.
• Convex functions. Constructions, characterizations and counterexamples
• Convex optimisation-based methods for K-complex detection
• Data Assimilation in Reduced Modeling
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Fast projection onto the simplex and the l₁ ball
• Finite-Dimensional Variational Inequalities and Complementarity Problems
• Golden ratio algorithms for variational inequalities
• scientific article; zbMATH DE number 1266748 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• scientific article; zbMATH DE number 2068041 (Why is no real title available?)
• scientific article; zbMATH DE number 2155014 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• scientific article; zbMATH DE number 3894826 (Why is no real title available?)
• scientific article; zbMATH DE number 3376275 (Why is no real title available?)
• Identifiable Surfaces in Constrained Optimization
• Identifying active manifolds.
• Nonlinear optimization.
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• On the Accurate Identification of Active Constraints
• On the Identification of Active Constraints
• On uniqueness of Kuhn-Tucker multipliers in nonlinear programming
• Optimal reduced model algorithms for data-based state estimation
• Scikit-learn: machine learning in Python
• Smoothing method for minimax problems
• The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
• The Minimum Covering Sphere Problem

This page was built for publication: Identification of active component functions in finite-max minimisation via a smooth reformulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6998538)