Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
type: Item
instance of: scholarly article
title: Exact penalty and optimality condition for nonseparable continuous piecewise linear programming
zbMATH Open document ID: 1255.90111
author: Jun Xu
author: Shuning Wang
author: Xiaolin Huang
published in: Journal of Optimization Theory and Applications
publication date: 2013-01-29T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 6132215
zbMATH Keywords: piecewise linear
zbMATH Keywords: nonlinear programming
zbMATH Keywords: exact penalty
zbMATH Keywords: local optimality condition
MaRDI profile type: Publication
full work available at URL: s10957-012-0032-7
OpenAlex ID: W2070938475
cites work: Discontinuous piecewise linear optimization
cites work: A simplex algorithm for piecewise-linear programming I: Derivation and proof
cites work: A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
cites work: A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
cites work: Approximating separable nonlinear functions via mixed zero-one programs
cites work: Models for representing piecewise linear cost functions
cites work: Nonconvex, lower semicontinuous piecewise linear optimization
cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
cites work: Hinging hyperplanes for regression, classification, and function approximation
cites work: High-level canonical piecewise linear representation using a simplicial partition
cites work: Generalization of Hinging Hyperplanes
cites work: Adaptive hinging hyperplanes and its applications in dynamic system identification
cites work: Region configurations for realizability of lattice piecewise-linear models.
cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
cites work: A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
cites work: Piecewise-linear approximations of multidimensional functions
cites work: Fitting piecewise linear continuous functions
cites work: On the hinge-finding algorithm for hingeing hyperplanes
cites work: Polyhedral mixture of linear experts for many-to-one mapping inversion and multiple controllers
cites work: Identification of dynamic systems using piecewise-affine basis function models
DOI: 10.1007/S10957-012-0032-7
Recommended article: Q3972960
Recommended article: Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs
Recommended article: A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
Recommended article: Exact penalty functions for nonlinear integer programming problems
Recommended article: An exact penalty function approach for nonlinear integer programming problems
Recommended article: Q3840141
Recommended article: Exact penalties and sufficient conditions for optimality in nonsmooth optimization
Recommended article: Q4278922
Recommended article: Exact penalty function for nonlinear programming problems
Recommended article: An interior-point piecewise linear penalty method for nonlinear programming
description: scientific article; zbMATH DE number 6132215