Exact penalty and optimality condition for nonseparable continuous piecewise linear programming

DOI10.1007/S10957-012-0032-7MaRDI QIDQ1934641zbMATH OpenOpenAlexFDO

Authors Jun Xu, Shuning Wang, Xiaolin Huang

Publication date 29 January 2013

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-012-0032-7

zbMATH Keywords

nonlinear programmingexact penaltypiecewise linearlocal optimality condition

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 16307
• Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
• A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
• Exact penalty functions for nonlinear integer programming problems
• An exact penalty function approach for nonlinear integer programming problems
• scientific article; zbMATH DE number 1186922
• Exact penalties and sufficient conditions for optimality in nonsmooth optimization
• scientific article; zbMATH DE number 500377
• Exact penalty function for nonlinear programming problems
• An interior-point piecewise linear penalty method for nonlinear programming

Cites work

• A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
• A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• Adaptive hinging hyperplanes and its applications in dynamic system identification
• Approximating separable nonlinear functions via mixed zero-one programs
• Discontinuous piecewise linear optimization
• Fitting piecewise linear continuous functions
• Generalization of Hinging Hyperplanes
• High-level canonical piecewise linear representation using a simplicial partition
• Hinging hyperplanes for regression, classification, and function approximation
• Identification of dynamic systems using piecewise-affine basis function models
• Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
• Models for representing piecewise linear cost functions
• Nonconvex, lower semicontinuous piecewise linear optimization
• On the hinge-finding algorithm for hingeing hyperplanes
• Piecewise-linear approximations of multidimensional functions
• Polyhedral mixture of linear experts for many-to-one mapping inversion and multiple controllers
• Region configurations for realizability of lattice piecewise-linear models.

Cited in

(2)

• Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization
• First- and second-order optimality conditions for piecewise smooth objective functions

This page was built for publication: Exact penalty and optimality condition for nonseparable continuous piecewise linear programming

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