A new sequential optimality condition for constrained nonsmooth optimization
From MaRDI portal
Publication:5114399
DOI10.1137/18M1228608zbMATH Open1477.90070OpenAlexW3036818994MaRDI QIDQ5114399FDOQ5114399
Authors: Elias Salomão Helou, Lucas E. A. Simões, S. A. Santos 
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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Linesearch-Based Derivative-Free Approach for Nonsmooth Constrained Optimization
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- A cone-continuity constraint qualification and algorithmic consequences
- A fast gradient and function sampling method for finite-max functions
- A new sequential optimality condition for constrained optimization and algorithmic consequences
- A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees
- A sequential optimality condition related to the quasi-normality constraint qualification and its algorithmic consequences
- A sequential quadratic programming algorithm for nonconvex, nonsmooth constrained optimization
- A survey on the kissing numbers.
- Addressing the greediness phenomenon in nonlinear programming by means of proximal augmented Lagrangians
- An Exact Penalization Viewpoint of Constrained Optimization
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
- An adaptive gradient sampling algorithm for non-smooth optimization
- An augmented penalty function method with penalty parameter updates for nonconvex optimization
- An implementation of Shor's \(r\)-algorithm
- An overview of bilevel optimization
- An update rule and a convergence result for a penalty function method
- Approximate KKT points and a proximity measure for termination
- Approximating Subdifferentials by Random Sampling of Gradients
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Calmness and Exact Penalization
- Convergence of the Gradient Sampling Algorithm for Nonsmooth Nonconvex Optimization
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
- Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences
- New upper bounds for kissing numbers from semidefinite programming
- Non-Linear Programming Via Penalty Functions
- Nonsmooth optimization via quasi-Newton methods
- Nonsmooth spectral gradient methods for unconstrained optimization
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- On optimality conditions in nondifferentiable programming
- On sequential optimality conditions for smooth constrained optimization
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- On the differentiability check in gradient sampling methods
- On the local convergence analysis of the gradient sampling method for finite max-functions
- On the minimization of possibly discontinuous functions by means of pointwise approximations
- On the relation between constant positive linear dependence condition and quasinormality constraint qualification
- Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
- Optimization of lipschitz continuous functions
- Outer trust-region method for constrained optimization
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Second-order optimality conditions for mathematical programs with equilibrium constraints
- Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
- Variational Analysis
Cited In (16)
- 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
- Sequential M-stationarity conditions for general optimization problems
- Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming
- Title not available (Why is that?)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary
- Optimality conditions, approximate stationarity, and applications -- a story beyond Lipschitzness
- 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)
