Second order necessary and sufficient conditions for convex composite NDO

DOI10.1007/BF02592016zbMath0641.49013MaRDI QIDQ3782317

James V. Burke

Publication date: 1987

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

second-order regularitysecond-order necessary and sufficient optimality conditions

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Convexity of real functions of several variables, generalizations (26B25) Optimality conditions for free problems in two or more independent variables (49K10)

Related Items

Optimality conditions for piecewise \(C^ 2\) nonlinear programming, A sequential quadratic programming method for potentially infeasible mathematical programs, Convex composite minimization with \(C^{1,1}\) functions, Second-order analysis of penalty function, Generalized second-order derivatives and optimality conditions, The subdifferential of measurable composite max integrands and smoothing approximation, Nonlinear Eigenvector Methods for Convex Minimization over the Numerical Range, Variational analysis of a composite function: A formula for the lower second order epi-derivative, Convex composite multi-objective nonsmooth programming, Nonlinear Lagrangian theory for nonconvex optimization., On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications, Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods, Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method, Minimal approximate Hessians for continuously Gâteaux differentiable functions, Proximally Guided Stochastic Subgradient Method for Nonsmooth, Nonconvex Problems, An inexact algorithm for composite nondifferentiable optimization, Second-order global optimality conditions for convex composite optimization, First- and Second-Order Epi-Differentiability in Nonlinear Programming, High-Order Optimization Methods for Fully Composite Problems, A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications

Cites Work

• Unnamed Item
• Discrete, non-linear approximation problems in polyhedral norms
• Necessary and Sufficient Conditions for a Local Minimum. 1: A Reduction Theorem and First Order Conditions
• Necessary and Sufficient Conditions for a Local Minimum. 2: Conditions of Levitin–Miljutin–Osmolovskii Type
• Necessary and Sufficient Conditions for a Local Minimum. 3: Second Order Conditions and Augmented Duality
• Marginal values and second-order necessary conditions for optimality
• On the global convergence of trust region algorithms for unconstrained minimization
• Local properties of algorithms for minimizing nonsmooth composite functions
• Optimization and nonsmooth analysis
• Descent methods for composite nondifferentiable optimization problems
• A Gauss-Newton Approach to Solving Generalized Inequalities
• Second-Order Sufficient Conditions in Nonsmooth Optimization
• Optimality conditions for piecewise smooth functions
• A model algorithm for composite nondifferentiable optimization problems
• Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems
• Convex Analysis