On conditions for optimality of the nonlinearl 1 problem
From MaRDI portal
Publication:3877428
DOI10.1007/BF01588238zbMath0436.90095OpenAlexW1969418881MaRDI QIDQ3877428
Publication date: 1979
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588238
optimality conditionsnetwork designsystem designnondifferentiable objective functionnonlinear l-1 problem
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 l1 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 l1 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