Solution sets of three sparse optimization problems for multivariate regression

2022 ◽  
Author(s):  
Xiaojun Chen ◽  
Lili Pan ◽  
Naihua Xiu
Keyword(s):  
Multivariate Regression ◽  
Optimization Problems ◽  
Sparse Optimization ◽  
Solution Sets

scholarly journals On solution sets of nonconvex Darboux problems and applications to optimal control with endpoint constraints

1996 ◽  
Vol 37 (3) ◽  
pp. 354-391 ◽  
Author(s):  
H. D. Tuan
Keyword(s):  
Constraint Qualification ◽  
Necessary Conditions ◽  
Optimization Problems ◽  
Regularity Assumption ◽  
Darboux Problem ◽  
Continuous Version ◽  
Open Mapping Theorem ◽  
Solution Sets ◽  
Relaxation Theorem ◽  
Endpoint Constraints

AbstractWe prove a continuous version of a relaxation theorem for the nonconvex Darboux problem xlt ε F(t, τ, x, xt, xτ). This result allows us to use Warga's open mapping theorem for deriving necessary conditions in the form of a maximum principle for optimization problems with endpoint constraints. Neither constraint qualification nor regularity assumption is supposed.

Evaluating solution sets of a posteriori solution techniques for bi-criteria combinatorial optimization problems

2005 ◽  
Vol 8 (1) ◽  
pp. 75-96 ◽  
Author(s):  
John W. Fowler ◽  
Bosun Kim ◽  
W. Matthew Carlyle ◽  
Esma Senturk Gel ◽  
Shwu-Min Horng
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
A Posteriori ◽  
Solution Sets ◽  
Combinatorial Optimization Problems ◽  
Solution Techniques
Sign in / Sign up

Export Citation Format

Share Document