Results 31 to 40 of about 151 (140)
Well-Posedness, Conditioning and Regularization of Minimization, Inclusion and Fixed-Point Problems [PDF]
, 1998 AMS subject classification: 65K10, 49M07, 90C25, 90C48.Well-posedness, conditioning and regularization of fixed-point problems are studied in connexion with well-posedness, conditioning and Tikhonov regularization of minimization and inclusion problems ...
Lemaire, B.
core
The lagrange approach to infinite linear programs
Infinite linear programs, convex problems, Lagrange approach, strong duality, 90C46, 90C25, 90C08,
Raquiel López-Martínez +2 more
core +1 more source
DrAmpl: a meta solver for optimization problem analysis
Optimization model, AMPL modeling language, Directed acyclic graph, Convexity assessment, Structural model analysis, Solver recommendation, C61, C63, 90C25, 90C26, 90C30,
Dominique Orban, R. Fourer
core +1 more source
A class of r-semipreinvex functions and optimality in nonlinear programming
Semi-connected sets, Semipreinvex functions, r-Semipreinvex functions, Optimality, Nonlinear programming, 90C25, 90C26, 90C30,
Ke Zhao, Zhe Chen, Xue Liu
core +1 more source
Multiobjective fractional programming with generalized convexity
Multiobjective fractional programming problem, weakly efficient solution, generalized convexity, 90C30, 90C25,
P. Ruíz-Canales +2 more
core +1 more source
A PVT-Type Algorithm for Minimizing a Nonsmooth Convex Function [PDF]
, 2003 2000 Mathematics Subject Classification: 90C25, 68W10, 49M37.A general framework of the (parallel variable transformation) PVT-type algorithm, called the PVT-MYR algorithm, for minimizing a non-smooth convex function is proposed, via the Moreau-Yosida ...
Pang, Li-Ping, Xia, Zun-Quan
core
Counterexamples on some articles on quasi-variational inclusion problems
Upper quasi-variational inclusion, Lower quasi-variational inclusion, Vector optimization problem, Upper and lower C-quasi-convex multi-valued mapping, Upper and lower C-continuous multi-valued mapping, 47H04, 90C25, 90C33, 90C47,
M. Vatandoost, H. Mohebi
core +1 more source
Finding a Strict Feasible Dual Initial Solution for Quadratic Semidefinite Programming
, 2012 In this paper, we propose an algorithm to comput the dual initial feasible solution for solving a primal-dual optimization problem (convex quadratic semidefinite programming) by a interior point methods.
Lakhdar Djeffal, El Amir Djeffal
core
Precise Undersampling Theorems [PDF]
, 2010 Undersampling theorems state that we may gather far fewer samples than the usual sampling theorem while exactly reconstructing the object of interest-provided the object in question obeys a sparsity condition, the samples measure appropriate linear ...
Tanner, Jared, Donoho, David L.
core +1 more source
Minimizing condition number via convex programming [PDF]
, 2011 In this paper we consider minimizing the spectral condition number of a positive semidefinite matrix over a nonempty closed convex set Ω. We show that it can be solved as a convex programming problem, and moreover, the optimal value of the latter problem
Ting Kei Pong, Zhaosong Lu
core +1 more source