A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints
From MaRDI portal
Publication:4995612
zbMath1478.90145arXiv2003.01759MaRDI QIDQ4995612
Publication date: 25 June 2021
Full work available at URL: https://arxiv.org/abs/2003.01759
Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Semi-infinite programming (90C34) Optimality conditions for minimax problems (49K35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Differentiability properties of metric projections onto convex sets
- A nonlinear augmented Lagrangian for constrained minimax problems
- Optimality conditions in terms of alternance: two approaches
- Necessary optimality conditions for nonsmooth semi-infinite programming problems
- Metric regularity, tangent sets, and second-order optimality conditions
- Augmented Lagrangian functions for cone constrained optimization: the existence of global saddle points and exact penalty property
- Dégénérescence dans les approximations de Tschebyscheff linéaires et discrètes
- A modified SQP algorithm for minimax problems
- An interior-point algorithm for nonlinear minimax problems
- A sequential quadratically constrained quadratic programming method for unconstrained minimax problems
- Computing a nearest symmetric positive semidefinite matrix
- An envelope-like effect of infinitely many inequality constraints on second-order necessary conditions for minimization problems
- Optimization. Algorithms and consistent approximations
- First and second order analysis of nonlinear semidefinite programs
- Synthesis of a rational filter in the presence of complete alternance
- Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
- A convergence analysis of the method of codifferential descent
- Nonmonotone line search algorithm for constrained minimax problems
- A class of nonlinear Lagrangian algorithms for minimax problems
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Optimality conditions for nonsmooth semidefinite programming via convexificators
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- Quadratically constraint quadratical algorithm model for nonlinear minimax problems
- Necessary optimality conditions for a nonsmooth semi-infinite programming problem
- Perturbation analysis of second-order cone programming problems
- Sensitivity Analysis of Optimization Problems Under Second Order Regular Constraints
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Optimality conditions for non-smooth semi-infinite programming
- A unifying theory of exactness of linear penalty functions
- A Nonlinear Lagrange Algorithm for Minimax Problems with General Constraints
- An interior point algorithm for continuous minimax: implementation and computation
- Semi-infinite programming, duality, discretization and optimality conditions†
- Matrix Analysis
- A Structure-Exploiting Algorithm for Nonlinear Minimax Problems
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems
- Alternance properties of the solutions of non-linear minimax problems with non-linear constraints
- Linearly constrained minimax optimization
- Lectures on Polytopes
- Variational Analysis
- An Algorithm for the Inequality-Constrained Discrete Min--Max Problem
- A Dual Approach to Semidefinite Least-Squares Problems
- Second Order Optimality Conditions Based on Parabolic Second Order Tangent Sets
- Quadratic rate of convergence of a linearization method for solving discrete minimax problems
- Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
- Lagrange Multipliers in Nonsmooth Semi-Infinite Optimization Problems
- Nonlinear Programming
- Convex Analysis
- The Differential Correction Algorithm for Rational $\ell _\infty $-Approximation
- Some Properties of the Augmented Lagrangian in Cone Constrained Optimization
- Alternance Form of Optimality Conditions in the Finite-Dimensional Space
This page was built for publication: A Unified Study of Necessary and Sufficient Optimality Conditions for Minimax and Chebyshev Problems with Cone Constraints
