On conditions for optimality of the nonlinearl 1 problem

DOI10.1007/BF01588238MaRDI QIDQ3877428zbMATH OpenOpenAlexFDO

Authors Christakis Charalambous

Publication date 1979

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01588238

zbMATH Keywords

network designnondifferentiable objective functionnonlinear l-1 problemoptimality conditionssystem design

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites work

• An Exact Potential Method for Constrained Maxima
• Constrained Optimization Using a Nondifferentiable Penalty Function
• Minimization Techniques for Piecewise Differentiable Functions: The l₁ Solution to an Overdetermined Linear System
• On an algorithm for discrete nonlinear L1 approximation

Cited in

(15)

• On conditions for optimality of a class of nondifferentiable functions
• Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions
• Vector exponential penalty function method for nondifferentiable multiobjective programming problems
• On the augmented subproblems within sequential methods for nonlinear programming
• A superlinearly convergent exact penalty method for constrained nonlinear least squares: global analysis
• A robust combined trust region-line search exact penalty projected structured scheme for constrained nonlinear least squares
• The exactness property of the vector exact \(l_{1}\) penalty function method in nondifferentiable invex multiobjective programming
• THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
• Second-order conditions for an exact penalty function
• Nonlinear programming via an exact penalty function: Global analysis
• Nonlinear programming via an exact penalty function: Asymptotic analysis
• The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems
• A Base-Point Descent Algorithm For Solving The Linear l 1 Problem
• Convergence analysis and competitive numerical results of a trust region-line search projected exact penalty algorithm
• A new vector exponential exact penalty approach for solving nonsmooth vector optimization problems

This page was built for publication: On conditions for optimality of the nonlinearl 1 problem

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