On conditions for optimality of the nonlinearl 1 problem

DOI10.1007/BF01588238zbMath0436.90095OpenAlexW1969418881MaRDI QIDQ3877428

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

optimality conditionsnetwork designsystem designnondifferentiable objective functionnonlinear l-1 problem

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Nonlinear programming via an exact penalty function: Global analysis, Nonlinear programming via an exact penalty function: Asymptotic analysis, On the augmented subproblems within sequential methods for nonlinear programming, 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₁ Penalty Function Method in Nondifferentiable Invex Multiobjective Programming, Convergence analysis of a class of nonlinear penalization methods for constrained optimization via first-order necessary optimality conditions, The vector exact \(l_{1}\) penalty method for nondifferentiable convex multiobjective programming problems, Vector exponential penalty function method for nondifferentiable multiobjective programming problems, THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS, Second-order conditions for an exact penalty function, A Base-Point Descent Algorithm For Solving The Linear l 1 Problem, Operations research and optimization (ORO), On conditions for optimality of a class of nondifferentiable functions

Cites Work

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