discipline 
Mathematics, Applied
mathematics 
subject 
Nonlinear
Programming I. (more details) 
lecturers 
Tibor Illés 
credits 

period 
3 
curriculum 
Convex sets, convex functions, convex inequalities. Nonlinear programming
problem. Characterization of optimal solutions. Separation of convex sets.
Necessary and sufficient optimality conditions for convex programming.
Specially structured convex optimization problems. Solution algorithms. 
literature 

form of tuition 
Lectures 
mode of assessment 
written/oral exam 