NUMERICAL SOLUTION OF A CLASS OF NON-CONVEX VARIATIONAL PROBLEMS BY SQP

DOI10.1081/NFA-120014752zbMath1026.49024MaRDI QIDQ4787841

Jan Mach

Publication date: 30 November 2003

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

zbMATH Keywords

relaxation; calculus of variations; numerical approximation; SQP method; non-linear programming

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

49M37: Numerical methods based on nonlinear programming

49M20: Numerical methods of relaxation type

Related Items

Linear-programming approach to nonconvex variational problems, Coarse-Convex-Compactification Approach to Numerical Solution of Nonconvex Variational Problems, Descent-Penalty Methods for Relaxed Nonlinear Elliptic Optimal Control Problems

Cites Work

• Unnamed Item
• Numerical analysis of oscillations in nonconvex problems
• A nonconvex variational problem related to change of phase
• Gradient Young measures generated by sequences in Sobolev spaces
• An anti-plane shear problem
• On the numerical analysis of non-convex variational problems
• Numerical approximation of Young measures in non-convex variational problems
• Finite element approximation of a microstructure evolution
• Approximated Convex Envelope of a Function
• A necessary and sufficient condition for nonattainment and formation of microstructure almost everywhere in scalar variational problems
• The lack of lower semicontinuity and nonexistence of minimizers
• Numerical solution of the scalar double-well problem allowing microstructure
• Numerical approximation of parametrized measures
• On minima of a functional of the gradient: necessary conditions