A new sequential optimality condition for constrained nonsmooth optimization
From MaRDI portal
Publication:5114399
DOI10.1137/18M1228608zbMATH Open1477.90070OpenAlexW3036818994MaRDI QIDQ5114399FDOQ5114399
S. A. Santos, Elias Salomão Helou, Lucas E. A. Simões
Publication date: 22 June 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1228608
Recommendations
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- On sequential optimality conditions for smooth constrained optimization
- A practical optimality condition without constraint qualifications for nonlinear programming
- Optimality Conditions for Nonconvex Constrained Optimization Problems
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
constrained optimizationnonsmooth nonconvex optimizationconstraint qualificationsequential optimality condition
Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)
Cites Work
- An implementation of Shor's \(r\)-algorithm
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- Variational Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- An overview of bilevel optimization
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Title not available (Why is that?)
- Nonsmooth optimization via quasi-Newton methods
- Title not available (Why is that?)
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- Optimization of lipschitz continuous functions
- Approximating Subdifferentials by Random Sampling of Gradients
- Calmness and Exact Penalization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- An Exact Penalization Viewpoint of Constrained Optimization
- Non-Linear Programming Via Penalty Functions
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- A Cone-Continuity Constraint Qualification and Algorithmic Consequences
- On sequential optimality conditions for smooth constrained optimization
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- On optimality conditions in nondifferentiable programming
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A New Sequential Optimality Condition for Constrained Optimization and Algorithmic Consequences
- New upper bounds for kissing numbers from semidefinite programming
- Title not available (Why is that?)
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- An adaptive gradient sampling algorithm for non-smooth optimization
- Title not available (Why is that?)
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- An update rule and a convergence result for a penalty function method
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- A survey on the kissing numbers
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Outer trust-region method for constrained optimization
- Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians
- Approximate KKT points and a proximity measure for termination
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- On the local convergence analysis of the gradient sampling method for finite max-functions
- A fast gradient and function sampling method for finite-max functions
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Nonsmooth spectral gradient methods for unconstrained optimization
- On the differentiability check in gradient sampling methods
- On the minimization of possibly discontinuous functions by means of pointwise approximations
- A Sequential Optimality Condition Related to the Quasi-normality Constraint Qualification and Its Algorithmic Consequences
- New Sequential Optimality Conditions for Mathematical Programs with Complementarity Constraints and Algorithmic Consequences
Cited In (14)
- Optimality conditions, approximate stationarity, and applications – a story beyond lipschitzness
- Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization
- A comparative study of sequential optimality conditions for mathematical programs with cardinality constraints
- Sequential optimality conditions for composed convex optimization problems
- Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
- A novel sequential optimality condition for smooth constrained optimization and algorithmic consequences
- On the fulfillment of the complementary approximate Karush-Kuhn-Tucker conditions and algorithmic applications
- On the directional asymptotic approach in optimization theory
- A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality
- A primal nonsmooth reformulation for bilevel optimization problems
Uses Software
This page was built for publication: A new sequential optimality condition for constrained nonsmooth optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5114399)
